A search algorithm for linear codes: Progressive dimension growth

DOI10.1007/S10623-007-9113-2zbMath1178.94215OpenAlexW2012814339MaRDI QIDQ1009177

Tsvetan Asamov, Nuh Aydin

Publication date: 31 March 2009

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

Full work available at URL: https://doi.org/10.1007/s10623-007-9113-2

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (1)

New linear codes from constacyclic codes

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Discovering mathematics with Magma. Reducing the abstract to the concrete
• Searching for linear codes with large minimum distance
• New quasi-twisted degenerate ternary linear codes
• New Quasi-Cyclic Codes From Simplex Codes
• The intractability of computing the minimum distance of a code
• New ternary quasi-cyclic codes with better minimum distances
• New ternary linear codes
• The structure of 1-generator quasi-twisted codes and new linear codes

This page was built for publication: A search algorithm for linear codes: Progressive dimension growth