Some lower bounds on the minimum weight of cyclic codes of composite length

DOI10.1109/TIT.1968.1054233zbMath0165.53502OpenAlexW2041674265MaRDI QIDQ5551983

Tadao Kasami

Publication date: 1968

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1968.1054233

zbMATH Keywords

information, communication

Related Items (5)

The weight hierarchy of the Kasami codes ⋮ The binary weight distribution of the extended (2 m,2 m-4) code of the Reed-Solomon code over GF(2 m) with generator polynomial (x-\(\alpha\) )(x- \(\alpha\) 2)(x-\(\alpha\) 3) ⋮ Algebraic theory of block codes detecting independent errors ⋮ Relative generalized Hamming weights of cyclic codes ⋮ A survey of constructive coding theory, and a table of binary codes of highest known rate

This page was built for publication: Some lower bounds on the minimum weight of cyclic codes of composite length