Srivastava codes

DOI10.1109/TIT.1972.1054760MaRDI QIDQ5639599zbMATH OpenFDO

Authors Hermann Josef Helgert

Publication date 1972

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

Full work available at URL https://doi.org/10.1109/TIT.1972.1054760

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited in

(5)

• Algebraic theory of block codes detecting independent errors
• A survey of constructive coding theory, and a table of binary codes of highest known rate
• Cyclic codes through \(B[X]\), \(B[X;\frac{1}{kp} \mathbb Z_0]\) and \(B[X;\frac{1}{p^k}\mathbb Z_0]\): a comparison
• Cyclic codes through \(B[X; \frac {a}{b}\mathbb Z_0]\), with \(\frac {a}{b}\in \mathbb Q^+\) and \(b=a+1\), and encoding
• Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding

This page was built for publication: Srivastava codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5639599)