On the covering radius of ternary extremal self-dual codes

DOI10.1023/B:DESI.0000035468.86695.40zbMATH Open1062.94072OpenAlexW2067392865MaRDI QIDQ702174FDOQ702174

Authors: Masaaki Harada, Michio Ozeki, Kenichiro Tanabe 

Publication date: 17 January 2005

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

Full work available at URL: https://doi.org/10.1023/b:desi.0000035468.86695.40

Recommendations

• Extremal self-dual codes with the smallest covering radius
• On the covering radius of ternary negacyclic codes with length up to 26
• On the covering radius problem for ternary self-dual codes
• On the covering radii of extremal doubly even self-dual codes
• Extremal self-dual \([40,20,8]\) codes with covering radius 7

zbMATH Keywords

self-dual codeternary codeCovering radius

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Cited In (8)

• Large Hermitian hull GRS codes of any given length
• Classification of ternary extremal self-dual codes of length 28
• Title not available (Why is that?)
• On the classification of the codes obtained by subtracting from some ternary extremal self-dual codes
• On the covering radii of extremal doubly even self-dual codes
• On the covering radius problem for ternary self-dual codes
• On the covering radius of ternary negacyclic codes with length up to 26
• Title not available (Why is that?)

This page was built for publication: On the covering radius of ternary extremal self-dual codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702174)