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

Direct link
Referera
Referensformat
  • apa
  • 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
A database of linear codes over F13 with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm
Högskolan Kristianstad, Sektionen för hälsa och samhälle, Avdelningen för Design och datavetenskap.ORCID-id: 0000-0002-2492-7754
USA.
2015 (engelsk)Inngår i: Journal of Algebra Combinatorics Discrete Structures and Application, ISSN 2148-838X, Vol. 2, nr 1, s. 1-18Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

Error control codes have been widely used in data communications and storage systems. One centralproblem in coding theory is to optimize the parameters of a linear code and construct codes withbest possible parameters. There are tables of best-known linear codes over finite fields of sizes up to9. Recently, there has been a growing interest in codes over F13 and other fields of size greater than9. The main purpose of this work is to present a database of best-known linear codes over the fieldF13 together with upper bounds on the minimum distances. To find good linear codes to establishlower bounds on minimum distances, an iterative heuristic computer search algorithm is employed toconstruct quasi-twisted (QT) codes over the field F13 with high minimum distances. A large numberof new linear codes have been found, improving previously best-known results. Tables of [pm;m] QTcodes over F13 with best-known minimum distances as well as a table of lower and upper bounds onthe minimum distances for linear codes of length up to 150 and dimension up to 6 are presented.

sted, utgiver, år, opplag, sider
Turkey, 2015. Vol. 2, nr 1, s. 1-18
Emneord [en]
Database of linear codes, Quasi-twisted codes, Heuristic search algorithm, Iterative search
HSV kategori
Identifikatorer
URN: urn:nbn:se:hkr:diva-13390OAI: oai:DiVA.org:hkr-13390DiVA, id: diva2:777858
Tilgjengelig fra: 2015-01-09 Laget: 2015-01-09 Sist oppdatert: 2018-01-11bibliografisk kontrollert

Open Access i DiVA

fulltext(595 kB)131 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 595 kBChecksum SHA-512
fca86d4d9050a6f6e062a9cb8e39918d45ba2fc8167d4506124dd51f7b6235a5b3701c07a6b478004ac673a1dddec7a8da9cbe431965f971ca9ce97105c7555f
Type fulltextMimetype application/pdf

Andre lenker

Fulltext

Personposter BETA

Chen, Eric Zhi

Søk i DiVA

Av forfatter/redaktør
Chen, Eric Zhi
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 131 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

urn-nbn

Altmetric

urn-nbn
Totalt: 214 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • 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