English

A note on binary completely regular codes with large minimum distance

Combinatorics 2014-04-08 v1 Information Theory math.IT
Authors: Neil I. Gillespie
View on arXiv ↗ PDF ↗

Abstract

We classify all binary error correcting completely regular codes of length nn with minimum distance δ>n/2\delta>n/2.

Keywords

coding theory combinatorial designs collatz conjecture

Cite

@article{arxiv.1210.6459,
  title  = {A note on binary completely regular codes with large minimum distance},
  author = {Neil I. Gillespie},
  journal= {arXiv preprint arXiv:1210.6459},
  year   = {2014}
}

Comments

4 pages

Related papers

View all related →
Information Theory · Computer Science
Results on Binary Linear Codes With Minimum Distance 8 and 10
Iliya Bouyukliev, Erik Jakobsson
2016-11-18
Combinatorics · Mathematics
Uniqueness of certain completely regular Hadamard codes
Neil I. Gillespie, Cheryl E. Praeger
2014-04-08
Combinatorics · Mathematics
On the size of maximal binary codes with 2, 3, and 4 distances
Alexander Barg, Alexey Glazyrin, Wei-Jiun Kao, Ching-Yi Lai +2
2025-07-14
Information Theory · Computer Science
An Approximate Coding-Rate Versus Minimum Distance Formula for Binary Codes
Yosef Akhtman, Robert G. Maunder, Lajos Hanzo
2012-06-29
Information Theory · Computer Science
The Perfect Binary One-Error-Correcting Codes of Length 15: Part I--Classification
Patric R. J. Östergård, Olli Pottonen
2015-03-13
Information Theory · Computer Science
Real-time error correction codes for deletable errors
Ghurumuruhan Ganesan
2021-03-02
Information Theory · Computer Science
Correcting a Fraction of Errors in Nonbinary Expander Codes with Linear Programming
Vitaly Skachek
2016-11-17
Information Theory · Computer Science
Constructing error-correcting binary codes using transitive permutation groups
Antti Laaksonen, Patric R. J. Östergård
2016-07-19
Information Theory · Computer Science
On linear completely regular codes with covering radius $\rho=1$. Construction and classification
J. Borges J. Rifa V. Zinoviev
2009-06-03
Information Theory · Computer Science
Construction and redundancy of codes for correcting deletable errors
Ghurumuruhan Ganesan
2018-05-03
Information Theory · Computer Science
Uncorrectable Errors of Weight Half the Minimum Distance for Binary Linear Codes
Kenji Yasunaga, Toru Fujiwara
2008-04-30
Information Theory · Computer Science
Binary sequences with length n and nonlinear complexity not less than n/2
Sicheng Liang, Xiangyong Zeng, Zibi Xiao, Zhimin Sun
2023-12-27
Information Theory · Computer Science
Minimum distances of binary optimal LCD codes of dimension five are completely determined
Yang Liu, Ruihu Li, Qiang Fu, Hao Song
2024-09-26
Information Theory · Computer Science
The Perfect Binary One-Error-Correcting Codes of Length 15: Part II--Properties
Patric R. J. Östergård, Olli Pottonen, Kevin T. Phelps
2010-10-07
Combinatorics · Mathematics
New characterisations of the Nordstrom-Robinson codes
Neil I. Gillespie, Cheryl E. Praeger
2017-02-03
Discrete Mathematics · Computer Science
De Bruijn Sequences with Minimum Discrepancy
Nicolás Álvarez, Verónica Becher, Martín Mereb, Ivo Pajor +1
2024-07-25
Information Theory · Computer Science
The zero-rate threshold for adversarial bit-deletions is less than 1/2
Venkatesan Guruswami, Xiaoyu He, Ray Li
2022-11-17
Information Theory · Computer Science
On Bounded-Weight Error-Correcting Codes
Russell Bent, Michael Schear, Lane A. Hemaspaandra, Gabriel Istrate
2007-10-15
Information Theory · Computer Science
Classification of 8-divisible binary linear codes with minimum distance 24
Sascha Kurz
2020-12-14
Combinatorics · Mathematics
On the classification of linear complementary dual codes
Makoto Araya, Masaaki Harada
2020-11-20
Information Theory · Computer Science
An improved bound on the fraction of correctable deletions
Boris Bukh, Venkatesan Guruswami, Johan Håstad
2016-03-02
Information Theory · Computer Science
Explicit two-deletion codes with redundancy matching the existential bound
Venkatesan Guruswami, Johan Håstad
2020-07-22
Information Theory · Computer Science
A Complete Linear Programming Hierarchy for Linear Codes
Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones
2021-12-20
Information Theory · Computer Science
Reconstructing Extended Perfect Binary One-Error-Correcting Codes from Their Minimum Distance Graphs
Ivan Yu. Mogilnykh, Patric R. J. Östergård, Olli Pottonen, Faina I. Solov'eva
2009-05-31
Information Theory · Computer Science
Binary $[n,(n\pm1)/2]$ cyclic codes with good minimum distances from sequences
Xianhong Xie, Yaxin Zhao, Zhonghua Sun, Xiaobo Zhou
2024-08-06
R2 v1 2026-06-21T22:26:56.454Z