Results 251 to 260 of about 12,742 (264)

Bounds on mixed binary/ternary codes

IEEE Transactions on Information Theory, 1998
A E Brouwer, P R J Ostergard, N J A Sloane   +2 more
exaly  

Some new bounds for binary multiple burst‐correcting codes

Electronics Letters, 2014
exaly  

Upper bounds on the rate of LDPC codes

IEEE Transactions on Information Theory, 2002
David Burshtein
exaly  

Tight upper bounds on the redundancy of Huffman codes

IEEE Transactions on Information Theory, 1989
exaly  

New lower bounds for binary codes of asymmetric distance two

IEEE Transactions on Information Theory, 1992
X -G Xia
exaly  

Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes

International Journal of Information and Coding Theory, 2016
Itzhak Tamo, Alexander Barg, Sreechakra Goparaju   +2 more
exaly  

Tight bounds on the redundancy of Huffman codes

IEEE Transactions on Information Theory, 1992
exaly  

Upper bounds for q-ary covering codes

IEEE Transactions on Information Theory, 1991
exaly  

Coding Bounds

1997
openaire   +1 more source

Bounds and constructions of asymmetric or unidirectional error-correcting codes

Applicable Algebra in Engineering, Communications and Computing, 1992
exaly