2 papers
cs.IT2018
Lower Bounds on the Redundancy of Huffman Codes with Known and Unknown Probabilities
Ian Blanes, Miguel Hernández-Cabronero, Joan Serra-Sagristà +1
In this paper we provide a method to obtain tight lower bounds on the minimum redundancy achievable by a Huffman code when the probability distribution underlying an alphabet is on…
cs.IT2008
Low-Density Parity-Check Codes Which Can Correct Three Errors Under Iterative Decoding
Shashi Kiran Chilappagari, Anantha Raman Krishnan, Bane Vasic +1
In this paper, we give necessary and sufficient conditions for low-density parity-check (LDPC) codes with column-weight three to correct three errors when decoded using hard-decisi…