An upper bound on the weight distribution of some systematic codes (Corresp.)

Author

Piret, Philippe

Author_Institution

Canon Research Centre France, Cesson-Sévigné, France

Volume

Issue

fYear

1985

fDate

7/1/1985 12:00:00 AM

Firstpage

520

Lastpage

521

Abstract

For a class of binary systematic codes of length $n$ and cardinality $2^{k}$ , including the class of linear $(n, k)$ binary cyclic codes, it is shown that the number of codewords of weight $\\lfloor \\omega n \\rfloor$ cannot be much larger than $2^{kH(\\omega )}$ .

Keywords

Coding/decoding; Binary codes; Linear code; Upper bound;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.1985.1057061

Filename

1057061

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=940392