Two new rate 2/p binary quasi-cyclic codes

DOI10.1109/18.333889MaRDI QIDQ4324149zbMATH OpenOpenAlexFDO

Authors T. Aaron Gulliver, Vijay K. Bhargava

Publication date 1 March 1995

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

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

zbMATH Keywords

best binary linear codeslower boundminimum distancequasi-cyclic codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Recommendations

• An updated table of rate 1/p binary quasi-cyclic codes
• New good rate (m-1)/pm ternary and quaternary quasi-cyclic codes
• A (105,10,47) binary quasi-cyclic code
• Nine good rate (m-1)/pm quasi-cyclic codes
• Six new binary quasi-cyclic codes

Cited in

(15)

• A (105,10,47) binary quasi-cyclic code
• An updated table of rate 1/p binary quasi-cyclic codes
• A class of 1-generator repeated root quasi-cyclic codes
• 1-generator quasi-cyclic codes
• Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory
• Cyclic codes with parameters \([p^k,p^{k-1},p]\) and \([2p^k,p^{k-1}(p-1),d\leq p]\)
• Nine good rate (m-1)/pm quasi-cyclic codes
• Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
• A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
• Equivalent rate 1/2 quasi-cyclic codes (Corresp.)
• Some new binary, quasi-cyclic codes
• Some new binary codes with improved minimum distances
• New binary coding results by circulants
• New quinary linear codes from quasi-twisted codes and their duals
• Quaternary 1-generator quasi-cyclic codes

This page was built for publication: Two new rate 2/p binary quasi-cyclic codes

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