Searching for (near) Optimal Codes

DOI10.1007/978-3-319-26626-8_38zbMath1478.94127DBLPconf/cocoa/LiMWL15OpenAlexW2405187698WikidataQ57968752 ScholiaQ57968752MaRDI QIDQ3467868

Ruihu Li, Yaping Mao, Meiqin Wei, Xue Liang Li

Publication date: 5 February 2016

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_38

zbMATH Keywords

optimal codeadditive codecirculant graphgraph codeFSD code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Related Items (1)

Unnamed Item

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Binary formally self-dual odd codes
• On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
• Recognizing circulant graphs of prime order in polynomial time
• On the spectral Ádám property for circulant graphs
• Binary optimal linear rate 1/2 codes
• Error-correcting codes from graphs
• Graph-based classification of self-dual additive codes over finite fields
• Directed graph representation of half-rate additive codes over \(\text{GF}(4)\)
• A SURVEY ON UNDIRECTED CIRCULANT GRAPHS
• On the Classification of Hermitian Self-Dual Additive Codes Over ${\rm GF}(9)$
• Reliable circulant networks with minimum transmission delay
• Fundamentals of Error-Correcting Codes
• Binary optimal odd formally self-dual codes.
• Classification of formally self-dual even codes of lengths up to 16

This page was built for publication: Searching for (near) Optimal Codes