代码搜索：Coding
找到约 9,366 项符合「Coding」的源代码
代码结果 9,366
www.eeworm.com/read/311519/13629783
pdf java coding stardard.pdf
www.eeworm.com/read/308043/13710783
h rdopt_coding_state.h
/*!
***************************************************************************
* \file
* rdopt_coding_state.h
*
* \author
* Heiko Schwarz
*
* \date
* 17. April 2001
*
www.eeworm.com/read/308043/13710821
c rdopt_coding_state.c
/*!
***************************************************************************
* \file rdopt_coding_state.c
*
* \brief
* Storing/restoring coding state for
* Rate-Distortion optim
www.eeworm.com/read/307091/13729237
asv preliminary_channel_coding.asv
function tx_block260 = Preliminary_channel_coding(tx244)
tx244 = round(rand(1,244));
%有用bit的抽取
g_function = [39 40 41 42 43 44 48 87 45 2,...
3 8 10 18 19 24 46 47 142 143,...
www.eeworm.com/read/306769/13737915
pdf vhdl_coding_style.pdf
www.eeworm.com/read/304244/13797336
h rdopt_coding_state.h
/**********************************************************************
* Software Copyright Licensing Disclaimer
*
* This software module was originally developed by contributors to the
* cou
www.eeworm.com/read/304244/13797370
c rdopt_coding_state.c
/**********************************************************************
* Software Copyright Licensing Disclaimer
*
* This software module was originally developed by contributors to the
* cou
www.eeworm.com/read/303685/13810294
m extended_hamming_coding.m
function code = extended_hamming_coding(msg)
%%%% (31,26)
%% x^5+x^2+1
poly=[1 0 0 1 0 1];
L=length(msg);
divisor = [msg,zeros(1,5)];
for k=1:L
if divisor(k)==1
divisor(k:k+5)=mo
www.eeworm.com/read/150018/5694572
py channel_coding_perf.py
"""
Copyright 2003 Mitsubishi Electric Research Laboratories All Rights
Reserved. Permission to use, copy and modify this software and its
documentation without fee for educational, r
www.eeworm.com/read/136571/5870854
h rdopt_coding_state.h
/*
***********************************************************************
* COPYRIGHT AND WARRANTY INFORMATION
*
* Copyright 2001, International Telecommunications Union, Geneva
*
* DISCLAIMER