New binary codes constructed by an old technique (Corresp.)

DOI10.1109/TIT.1983.1056745MaRDI QIDQ3315432zbMATH OpenFDO

Authors James A. Wiseman

Publication date 1983

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

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

zbMATH Keywords

concatenation procedurequadratic residue code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• New binary codes
• Two new four-error-correcting binary codes
• Two new nonlinear binary codes
• New binary codes from a generalization of Zinoviev's technique
• New binary codes from a chain of cyclic codes

Cited in

(7)

• New binary codes from a generalization of Zinoviev's technique
• Some codes related to BCH-codes of low dimension
• On a new method of coding of information
• Two new nonlinear binary codes
• scientific article; zbMATH DE number 26596 (Why is no real title available?)
• Some efficient binary codes constructed using Srivastava codes (Corresp.)
• New binary codes

This page was built for publication: New binary codes constructed by an old technique (Corresp.)

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