New Lower Bounds on Binary Constant Weight Error-Correcting Codes

Michael Braun; Joshua Humpich; Antti Laaksonen; Patric R.J. Östergård

New Lower Bounds on Binary Constant Weight Error-Correcting Codes

Michael Braun^*, Joshua Humpich, Antti Laaksonen, Patric R.J. Östergård

^*Tämän työn vastaava kirjoittaja

Münster University of Applied Sciences

Tutkimustuotos: Lehtiartikkeli › Article › Scientific › vertaisarvioitu

1 Sitaatiot (Scopus)

Abstrakti

Let A(n,d,w) denote the maximum size of a binary code with length n, minimum distance d and constant weight w. The following lower bounds are here obtained in computer searches for codes with prescribed automorphisms: A(16,4,6) 624, A(19,4,8) 4698, A(20,4,8) 7830, A(21,4,6) 2880, A(22,6,6) 343, A(24,4,5) 1920, A(24,6,9) 3080, A(24,6,11) 5376, A(24,6,12) 5558, A(25,4,5) 2380, A(25,6,10) 6600, A(26,4,5) 2816 and A(27,4,5) 3456.

Alkuperäiskieli	Englanti
Sivut	213-223
Sivumäärä	11
Julkaisu	Journal of Combinatorial Mathematics and Combinatorial Computing
Vuosikerta	111
Tila	Julkaistu - marrask. 2019
OKM-julkaisutyyppi	A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä

Muut tiedostot ja linkit

Link to publication in Scopus

Siteeraa tätä

@article{d19889fc12744caba07544527d072530,

title = "New Lower Bounds on Binary Constant Weight Error-Correcting Codes",

abstract = "Let A(n,d,w) denote the maximum size of a binary code with length n, minimum distance d and constant weight w. The following lower bounds are here obtained in computer searches for codes with prescribed automorphisms: A(16,4,6) 624, A(19,4,8) 4698, A(20,4,8) 7830, A(21,4,6) 2880, A(22,6,6) 343, A(24,4,5) 1920, A(24,6,9) 3080, A(24,6,11) 5376, A(24,6,12) 5558, A(25,4,5) 2380, A(25,6,10) 6600, A(26,4,5) 2816 and A(27,4,5) 3456.",

author = "Michael Braun and Joshua Humpich and Antti Laaksonen and {\"O}sterg{\aa}rd, {Patric R.J.}",

note = "tarkista DOI",

year = "2019",

month = nov,

language = "English",

volume = "111",

pages = "213--223",

journal = "Journal of Combinatorial Mathematics and Combinatorial Computing",

issn = "0835-3026",

publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - New Lower Bounds on Binary Constant Weight Error-Correcting Codes

AU - Braun, Michael

AU - Humpich, Joshua

AU - Laaksonen, Antti

AU - Östergård, Patric R.J.

N1 - tarkista DOI

PY - 2019/11

Y1 - 2019/11

N2 - Let A(n,d,w) denote the maximum size of a binary code with length n, minimum distance d and constant weight w. The following lower bounds are here obtained in computer searches for codes with prescribed automorphisms: A(16,4,6) 624, A(19,4,8) 4698, A(20,4,8) 7830, A(21,4,6) 2880, A(22,6,6) 343, A(24,4,5) 1920, A(24,6,9) 3080, A(24,6,11) 5376, A(24,6,12) 5558, A(25,4,5) 2380, A(25,6,10) 6600, A(26,4,5) 2816 and A(27,4,5) 3456.

AB - Let A(n,d,w) denote the maximum size of a binary code with length n, minimum distance d and constant weight w. The following lower bounds are here obtained in computer searches for codes with prescribed automorphisms: A(16,4,6) 624, A(19,4,8) 4698, A(20,4,8) 7830, A(21,4,6) 2880, A(22,6,6) 343, A(24,4,5) 1920, A(24,6,9) 3080, A(24,6,11) 5376, A(24,6,12) 5558, A(25,4,5) 2380, A(25,6,10) 6600, A(26,4,5) 2816 and A(27,4,5) 3456.

UR - http://www.scopus.com/inward/record.url?scp=85096365148&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85096365148

SN - 0835-3026

VL - 111

SP - 213

EP - 223

JO - Journal of Combinatorial Mathematics and Combinatorial Computing

JF - Journal of Combinatorial Mathematics and Combinatorial Computing

ER -

New Lower Bounds on Binary Constant Weight Error-Correcting Codes

Abstrakti

Muut tiedostot ja linkit

Sormenjälki

Siteeraa tätä