New good quasi-cyclic ternary and quaternary linear codes
From MaRDI portal
Publication:4371913
DOI10.1109/18.623167zbMath0887.94012OpenAlexW2103020999MaRDI QIDQ4371913
T. Aaron Gulliver, Rumen N. Daskalov
Publication date: 21 January 1998
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.623167
Related Items (11)
New binary \(h\)-generator quasi-cyclic codes by augmentation and new minimum distance bounds ⋮ A database of linear codes over \(\mathbb F_{13}\) with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm ⋮ A generalization of quasi-twisted codes: multi-twisted codes ⋮ New linear codes from constacyclic codes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quasi-cyclic codes over \(\mathbb F_{13}\) and enumeration of defining polynomials ⋮ New linear codes over GF(8) ⋮ A new iterative computer search algorithm for good quasi-twisted codes ⋮ New quasi-cyclic codes over \({\mathbb F}_{5}\)
This page was built for publication: New good quasi-cyclic ternary and quaternary linear codes