New lower bounds on error-correcting ternary, quaternary and quinary codes

Antti Laaksonen; Patric R.J. Östergård

doi:10.1007/978-3-319-66278-7_19

New lower bounds on error-correcting ternary, quaternary and quinary codes

Antti Laaksonen^*, Patric R.J. Östergård

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

Information Theory

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference article in proceedings › Scientific › vertaisarvioitu

6 Sitaatiot (Scopus)

Abstrakti

Let A_q(n,d) denote the maximum size of a q-ary code with size n and minimum distance d. For most values of n and d, only lower and upper bounds on A_q(n,d) are known. In this paper we present 19 new lower bounds where q ϵ {3,4,5}. The bounds are based on codes whose automorphisms are prescribed by transitive permutation groups. An exhaustive computer search was carried out to find the new codes.

Alkuperäiskieli	Englanti
Otsikko	Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings
Kustantaja	Springer
Sivut	228-237
Sivumäärä	10
Vuosikerta	10495 LNCS
ISBN (painettu)	9783319662770
DOI - pysyväislinkit	https://doi.org/10.1007/978-3-319-66278-7_19
Tila	Julkaistu - 2017
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisussa
Tapahtuma	International Castle Meeting on Coding Theory and Applications - Vihula, Viro Kesto: 28 elok. 2017 → 31 elok. 2017 Konferenssinumero: 5

Julkaisusarja

Nimi	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Vuosikerta	10495 LNCS
ISSN (painettu)	03029743
ISSN (elektroninen)	16113349

Conference

Conference	International Castle Meeting on Coding Theory and Applications
Lyhennettä	ICMCTA
Maa/Alue	Viro
Kaupunki	Vihula
Ajanjakso	28/08/2017 → 31/08/2017

Pääsy asiakirjaan

10.1007/978-3-319-66278-7_19

Muut tiedostot ja linkit

Link to publication in Scopus

Siteeraa tätä

Laaksonen, A., & Östergård, P. R. J. (2017). New lower bounds on error-correcting ternary, quaternary and quinary codes. teoksessa Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings (Vuosikerta 10495 LNCS, Sivut 228-237). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vuosikerta 10495 LNCS). Springer. https://doi.org/10.1007/978-3-319-66278-7_19

Laaksonen, Antti ; Östergård, Patric R.J. / New lower bounds on error-correcting ternary, quaternary and quinary codes. Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings. Vuosikerta 10495 LNCS Springer, 2017. Sivut 228-237 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{23c64cfb7fb343208945bc37bcb17e73,

title = "New lower bounds on error-correcting ternary, quaternary and quinary codes",

abstract = "Let Aq(n,d) denote the maximum size of a q-ary code with size n and minimum distance d. For most values of n and d, only lower and upper bounds on Aq(n,d) are known. In this paper we present 19 new lower bounds where q ϵ {3,4,5}. The bounds are based on codes whose automorphisms are prescribed by transitive permutation groups. An exhaustive computer search was carried out to find the new codes.",

keywords = "Bounds on codes, Error-correcting codes, Transitive groups",

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

year = "2017",

doi = "10.1007/978-3-319-66278-7_19",

language = "English",

isbn = "9783319662770",

volume = "10495 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "228--237",

booktitle = "Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings",

address = "Germany",

note = "International Castle Meeting on Coding Theory and Applications , ICMCTA ; Conference date: 28-08-2017 Through 31-08-2017",

}

Laaksonen, A & Östergård, PRJ 2017, New lower bounds on error-correcting ternary, quaternary and quinary codes. julkaisussa Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings. Vuosikerta 10495 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vuosikerta 10495 LNCS, Springer, Sivut 228-237, International Castle Meeting on Coding Theory and Applications , Vihula, Viro, 28/08/2017. https://doi.org/10.1007/978-3-319-66278-7_19

New lower bounds on error-correcting ternary, quaternary and quinary codes. / Laaksonen, Antti; Östergård, Patric R.J.
Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings. Vuosikerta 10495 LNCS Springer, 2017. s. 228-237 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vuosikerta 10495 LNCS).

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussa › Conference article in proceedings › Scientific › vertaisarvioitu

TY - GEN

T1 - New lower bounds on error-correcting ternary, quaternary and quinary codes

AU - Laaksonen, Antti

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

N1 - Conference code: 5

PY - 2017

Y1 - 2017

N2 - Let Aq(n,d) denote the maximum size of a q-ary code with size n and minimum distance d. For most values of n and d, only lower and upper bounds on Aq(n,d) are known. In this paper we present 19 new lower bounds where q ϵ {3,4,5}. The bounds are based on codes whose automorphisms are prescribed by transitive permutation groups. An exhaustive computer search was carried out to find the new codes.

AB - Let Aq(n,d) denote the maximum size of a q-ary code with size n and minimum distance d. For most values of n and d, only lower and upper bounds on Aq(n,d) are known. In this paper we present 19 new lower bounds where q ϵ {3,4,5}. The bounds are based on codes whose automorphisms are prescribed by transitive permutation groups. An exhaustive computer search was carried out to find the new codes.

KW - Bounds on codes

KW - Error-correcting codes

KW - Transitive groups

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

U2 - 10.1007/978-3-319-66278-7_19

DO - 10.1007/978-3-319-66278-7_19

M3 - Conference article in proceedings

AN - SCOPUS:85028528721

SN - 9783319662770

VL - 10495 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 228

EP - 237

BT - Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings

PB - Springer

T2 - International Castle Meeting on Coding Theory and Applications

Y2 - 28 August 2017 through 31 August 2017

ER -

Laaksonen A, Östergård PRJ. New lower bounds on error-correcting ternary, quaternary and quinary codes. julkaisussa Coding Theory and Applications - 5th International Castle Meeting, ICMCTA 2017,Proceedings. Vuosikerta 10495 LNCS. Springer. 2017. s. 228-237. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-66278-7_19

New lower bounds on error-correcting ternary, quaternary and quinary codes

Abstrakti

Julkaisusarja

Conference

Pääsy asiakirjaan

Muut tiedostot ja linkit

Sormenjälki

Siteeraa tätä