New binary \(h\)-generator quasi-cyclic codes by augmentation and new minimum distance bounds

DOI10.1007/S10623-015-0059-5zbMath1348.94077OpenAlexW2087721965MaRDI QIDQ300379

Eric Zhi Chen

Publication date: 27 June 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-015-0059-5

zbMATH Keywords

quasi-cyclic codeslinear codessearch algorithmcoding theorybest-known codesconstruction X

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Related Items (3)

Further results on LCD generalized Gabidulin codes ⋮ New binary linear codes from quasi-cyclic codes and an augmentation algorithm ⋮ Unnamed Item

Uses Software

• Magma

Cites Work

• Unnamed Item
• The Magma algebra system. I: The user language
• New quasi-cyclic codes over \({\mathbb F}_{5}\)
• New quasi-twisted degenerate ternary linear codes
• New Quasi-Cyclic Codes From Simplex Codes
• Nine good rate (m-1)/pm quasi-cyclic codes
• On quasi-cyclic codes with rate l m (Corresp.)
• Six new binary quasi-cyclic codes
• New good quasi-cyclic ternary and quaternary linear codes
• New ternary quasi-cyclic codes with better minimum distances
• Some new binary, quasi-cyclic codes
• Some results on quasi-cyclic codes
• The structure of 1-generator quasi-twisted codes and new linear codes

This page was built for publication: New binary \(h\)-generator quasi-cyclic codes by augmentation and new minimum distance bounds