Cyclotomic trace codes

DOI10.3390/a12080168zbMath1457.94232OpenAlexW2969022058WikidataQ127368213 ScholiaQ127368213MaRDI QIDQ2005571

Dean Crnković, Andrea Švob, Vladimir D. Tonchev

Publication date: 8 October 2020

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a12080168

zbMATH Keywords

strongly regular graphlinear codeblock designtwo-weight code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30)

Related Items

Infinite families of \(t\)-designs and strongly regular graphs from punctured codes ⋮ A new construction of two-, three- and few-weight codes via our GU codes and their applications

Uses Software

• Magma
• Code Tables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A construction of binary linear codes from Boolean functions
• Several classes of linear codes and their weight distributions
• Distance regular graphs of diameter 3 and strongly regular graphs
• Quantum codes from caps
• Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph
• Few-weight codes from trace codes over a local ring
• The classification of antipodal two-weight linear codes
• A link between combinatorial designs and three-weight linear codes
• Three-weight ternary linear codes from a family of cyclic difference sets
• Some new two-weight codes and strongly regular graphs
• On Bonisoli's theorem and the block codes of Steiner triple systems
• Linear Codes From Some 2-Designs
• Searching for linear codes with large minimum distance
• Cyclotomic Linear Codes of Order $3$
• Two-Weight Codes Punctured from Irreducible Cyclic Codes
• The Geometry of Two-Weight Codes
• Fundamentals of Error-Correcting Codes
• Quantum error correction via codes over GF(4)