On the performance of binary extremal self-dual codes

DOI10.3934/AMC.2011.5.267zbMATH Open1260.94076OpenAlexW1965694452MaRDI QIDQ2275879FDOQ2275879

Authors: Stefka Bouyuklieva, Anton Malevich, Wolfgang Willems 

Publication date: 10 August 2011

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2011.5.267

Recommendations

• Performance of ternary double circulant, double twistulant, and self-dual codes
• On the performance of optimal double circulant even codes
• The Simplex Codes and Other Even-Weight Binary Linear Codes for Error Correction
• Extremal binary self-dual codes
• A projection decoding of a binary extremal self-dual code of length 40

zbMATH Keywords

binary self-dual extremal codesdecoding error probabilities

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35) Error probability in coding theory (94B70)

Cited In (6)

• Performance of ternary double circulant, double twistulant, and self-dual codes
• Title not available (Why is that?)
• Nonexistence of certain singly even self-dual codes with minimal shadow
• Singly even self-dual codes of length \(24k + 10\) and minimum weight \(4k + 2\)
• A projection decoding of a binary extremal self-dual code of length 40
• On the performance of optimal double circulant even codes

This page was built for publication: On the performance of binary extremal self-dual codes

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