[HTML][HTML] A short note on exponentiated mean codeword length for the best!: 1 code
IJ Taneja - Mathematica Applicada e Computational, 1984 - books.google.com
A short note on exponentiated mean codeword length for the best!: 1 code Page 109 Mat. Aplic.
Comp., W. 3, n 2, pp. 199a 204, 1984 © Editora Campus Ltda., Rio de Janeiro, RJ, impresso no …
Comp., W. 3, n 2, pp. 199a 204, 1984 © Editora Campus Ltda., Rio de Janeiro, RJ, impresso no …
Bounds on the size of a code
T Ericson - Topics in Coding Theory: In honour of Lars H …, 2006 - Springer
Bounds on the size of a code Page 1 Bounds on the Size of a Code Thomas Ericson
Department of Electrical Engineering, LinkSping University S-582 62 Link~ping, Sweden …
Department of Electrical Engineering, LinkSping University S-582 62 Link~ping, Sweden …
[PDF][PDF] Some remarks on the construction of optimal codes
G Katona, MA Lee - ACTA MATHEMATICA ACADEMIAE …, 1972 - real.mtak.hu
PRoor. Let I be the maximum of the code word lengths for C. We may assume that C is
instantaneous. Thus by Theorem 1 l–1 is the only other possible code word length. Let s (0; …
instantaneous. Thus by Theorem 1 l–1 is the only other possible code word length. Let s (0; …
Minimax codes for finite alphabets (Corresp.)
J Rissanen - IEEE Transactions on Information Theory, 1978 - ieeexplore.ieee.org
Minimax codes are designed for applications where the symbol probabilities are not known
except for their order. A minimax code is defined by real-valued parameters/,(resembling the …
except for their order. A minimax code is defined by real-valued parameters/,(resembling the …
[引用][C] On maximal comma-free codes (corresp.)
Y Niho - IEEE Transactions on Information Theory, 1973 - ieeexplore.ieee.org
On maximal comma-free codes (Corresp.) Page 1 580 IEEE TRANSACTIONS ON
INFORMATION THEORY, JULY 1973 As a result it can be easily seen that a syndrome …
INFORMATION THEORY, JULY 1973 As a result it can be easily seen that a syndrome …
Development of two new mean codeword lengths
O Parkash, P Kakkar - Information Sciences, 2012 - Elsevier
Two new mean codeword lengths L (α, β) and L (β) are defined and it is shown that these
lengths satisfy desirable properties as a measure of typical codeword lengths. Consequently …
lengths satisfy desirable properties as a measure of typical codeword lengths. Consequently …
New lower bounds for constant weight codes
CLM Van Pul, T Etzion - IEEE transactions on information …, 1989 - ieeexplore.ieee.org
New lower bounds for constant weight codes Page 1 1324 IEEE TRANSACTIONS ON
INFORMATION THEORY, VOL. 35. NO. 6. NOVEMBER 1989 On the other hand, the effect of …
INFORMATION THEORY, VOL. 35. NO. 6. NOVEMBER 1989 On the other hand, the effect of …
Codes and character sums
A Tietäväinen - Coding Theory and Applications: 3rd International …, 1989 - Springer
The proofs of the results of the sections 4 and 5 depend heavily on the deep works of Carlitz
and Uchiyama, Deligne, Lang and Weil, and Bombieri, because the essential difficulty was …
and Uchiyama, Deligne, Lang and Weil, and Bombieri, because the essential difficulty was …
[引用][C] Some new upper bounds for constant weight codes (Corresp.)
M Colbourn - IEEE Transactions on Information Theory, 1980 - ieeexplore.ieee.org
Some new upper bounds for constant weight codes (Corresp.) Page 1 Some New Upper
Bounds for Constant Weight On the Rate-Distortion Function for the Nonstationary Codes …
Bounds for Constant Weight On the Rate-Distortion Function for the Nonstationary Codes …
Lower bounds for constant weight codes
Let A (n, 2 δ, w) denote the maximum number of codewords in any binary code of length n,
constant weight w, and Hamming distance 2 δ Several lower bounds for A (n, 2 δ, w) are …
constant weight w, and Hamming distance 2 δ Several lower bounds for A (n, 2 δ, w) are …