hkr.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
New binary h-generator quasi-cyclic codes by augmentation and new minimum distance bounds
Högskolan Kristianstad, Sektionen för hälsa och samhälle, Avdelningen för Design och datavetenskap.ORCID-id: 0000-0002-2492-7754
2016 (Engelska)Ingår i: Designs, Codes and Cryptography, ISSN 0925-1022, E-ISSN 1573-7586, Vol. 80, nr 1, s. 1-10Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

An [n, k, d] code is a binary linear code of block length n, dimension k and minimum Hamming distance d. Since the minimum distance determines the error detection or correction capability, it is desired that d is as large as possible for the given block length n and dimension k. One of the most fundamental problems in coding theory is to construct codes with best possible minimum distances. This problem is very difficult in both theory and practice. During the last decades, it has proved that the class of quasi-cyclic (QC) codes contain many such codes. In this paper, augmentation of binary QC codes is studied. A new augmentation algorithm is presented, and 10 new h-generator QC codes that are better than previously known code have been constructed. Furthermore, Construction X has been applied to obtain another 18 new improved binary linear codes.With the standard construction techniques, a total of 124 new binary linear codes that improve the lower bound on the minimum distance have been obtained.

Ort, förlag, år, upplaga, sidor
2016. Vol. 80, nr 1, s. 1-10
Nyckelord [en]
Best-known codes, Coding theory, Search algorithm, Linear codes, Quasi-cyclic codes, Construction X
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
URN: urn:nbn:se:hkr:diva-13742DOI: 10.1007/s10623-015-0059-5ISI: 000377188000001OAI: oai:DiVA.org:hkr-13742DiVA, id: diva2:797643
Tillgänglig från: 2015-03-24 Skapad: 2015-03-24 Senast uppdaterad: 2018-01-11Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Personposter BETA

Chen, Eric Zhi

Sök vidare i DiVA

Av författaren/redaktören
Chen, Eric Zhi
Av organisationen
Avdelningen för Design och datavetenskap
I samma tidskrift
Designs, Codes and Cryptography
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 102 träffar
RefereraExporteraLänk till posten
Permanent länk

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