hkr.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
New quasi-twisted codes over F11— minimum distance bounds and a new database
Högskolan Kristianstad, Sektionen för hälsa och samhälle, Avdelningen för Design och datavetenskap. (Computer Science)ORCID-id: 0000-0002-2492-7754
USA.
2015 (engelsk)Inngår i: Journal of Information and Optimization Sciences, ISSN 0252-2667, E-ISSN 2169-0103, Vol. 36, nr 1-2, s. 129-157Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

One fundamental and challenging problem in coding theory is to optimize the parameters [nk,d] of a linear code over the finite field Fq and construct codes with best possible parameters. There are tables and databases of best-known linear codes over the finite fields of size up to 9 together with upper bounds on the minimum distances. Motivated by recent works on codes over F11, we present a table of best-known linear codes over F11 together with upper bounds on minimum distances. Our table covers the range n ≤ 150 for the length, and 3 ≤ k ≤ 7 for the dimension. To the best of our knowledge, this is the first time such a table is presented in the literature. For the construction of the best-known codes, we employed an iterative heuristic search algorithm to search for new linear codes in the class of quasi-twisted (QT) codes. The search yielded many new codes with better parameters than previously known codes. In many cases, optimal codes are obtained. In addition to presenting a comprehensive table of best-known codes over F11 of dimensions up to 7 with upper bounds on the minimum distances, we also present separate tables for the optimal codes and new QT codes over F11. We hope that this work will be a useful source for further study on codes over F11.

sted, utgiver, år, opplag, sider
2015. Vol. 36, nr 1-2, s. 129-157
Emneord [en]
Quasi-twisted codes, heuristic search algorithm, iterative search, distance bounds
HSV kategori
Identifikatorer
URN: urn:nbn:se:hkr:diva-13778DOI: 10.1080/02522667.2014.961788OAI: oai:DiVA.org:hkr-13778DiVA, id: diva2:800862
Tilgjengelig fra: 2015-04-08 Laget: 2015-04-08 Sist oppdatert: 2018-01-11bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekst

Personposter BETA

Chen, Eric Zhi

Søk i DiVA

Av forfatter/redaktør
Chen, Eric Zhi
Av organisasjonen
I samme tidsskrift
Journal of Information and Optimization Sciences

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 51 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf