Lower Bound for the Linear Multiple Packing of the Binary Hamming Space

Journal of Combinatorial Theory. Series A

Volumn 92, Issue 1, 2000, Pages 95-101

  Blinovsky, Volodia ^a  

^a INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

Linear code; Multiple packing

Indexed keywords

EID: 0006176325     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.1999.3053     Document Type: Article

References (6)

1. Elias P. List Decoding for Noisy Channels. Wescon Convention Rec. 1957;Inst. Radio Eng. p. 94-104.
2. Blinovsky V. Bounds for code in the case of list decoding of finite volume. Problems Inform. Transmission. 22:1986;7-19.
3. Blinovsky V. Asymptotic Combinatorial Coding Theory. 1997;Kluwer Academic, Dordrecht.
4. Blinovsky V. Lower bound on error probability in fixed volume list decoding. Problems Inform. Transmission. 27:1991;288-302.
5. MacWilliams F. J., Sloane N. J. A. The Theory of Error-Correcting Codes. 1977;North-Holland, Amsterdam.
6. Wei V., Feng G. Improved lower bounds on the sizes of error-correcting codes for list decoding. IEEE Trans. Inform. Theory. 1994;558-563.