Some efficient binary codes constructed using Srivastava codes (Corresp.)

DOI10.1109/TIT.1975.1055426MaRDI QIDQ4066980zbMATH OpenFDO

Authors Yasuo Sugiyama, Masao Kasahara, Shigeichi Hirasawa, Toshihiko Namekawa

Publication date 1975

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

zbMATH Keywords

new class of binary codesSrivastava codessymmetry properties of parity check matrix

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• New binary codes from extended Goppa codes
• New binary codes
• New binary codes constructed by an old technique (Corresp.)
• Goppa and Srivastava codes over finite rings
• A new class of binary codes constructed on the basis of BCH codes (Corresp.)

Cited in

(2)

• A new class of binary codes constructed on the basis of BCH codes (Corresp.)
• Efficiency of chain codes to represent binary objects

This page was built for publication: Some efficient binary codes constructed using Srivastava codes (Corresp.)

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