New good rate \((m-1)/pm\) ternary and quaternary quasi-cyclic codes
From MaRDI portal
Publication:1910433
zbMath0843.94019MaRDI QIDQ1910433
T. Aaron Gulliver, Vijay K. Bhargava
Publication date: 8 April 1996
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Related Items (14)
New bounds for the minimum length of quaternary linear codes of dimension five ⋮ New binary linear codes from quasi-cyclic codes and an augmentation algorithm ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quasi-cyclic codes over \(\mathbb F_{13}\) and enumeration of defining polynomials ⋮ Two-dimensional generalized discrete Fourier transform and related quasi-cyclic Reed--Solomon codes ⋮ New linear codes over GF(8) ⋮ A new iterative computer search algorithm for good quasi-twisted codes ⋮ Some results on the structure of constacyclic codes and new linear codes over \(\mathrm{GF}(7)\) from quasi-twisted codes ⋮ Some new linear codes from skew cyclic codes and computer algebra challenges ⋮ Algebraic structure of quasicyclic codes ⋮ On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes ⋮ New linear codes over non-prime fields ⋮ Entanglement-assisted quantum codes from quaternary codes of dimension five
This page was built for publication: New good rate \((m-1)/pm\) ternary and quaternary quasi-cyclic codes
