An upper bound on<tex>k/n</tex>for affine-invariant codes with fixed<tex>d/n</tex>(Corresp.)

DOI10.1109/TIT.1969.1054254zbMath0169.21604OpenAlexW2037201304MaRDI QIDQ5556156

Tadao Kasami

Publication date: 1969

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

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

zbMATH Keywords

information, communication

Related Items (6)

Long module skew codes are good ⋮ Several classes of asymptotically good quasi-twisted codes with a low index ⋮ Algebraic theory of block codes detecting independent errors ⋮ Fast message authentication using efficient polynomial evaluation ⋮ On the number of factorizations of polynomials over finite fields ⋮ A survey of constructive coding theory, and a table of binary codes of highest known rate

This page was built for publication: An upper bound on&lt;tex&gt;k/n&lt;/tex&gt;for affine-invariant codes with fixed&lt;tex&gt;d/n&lt;/tex&gt;(Corresp.)