hkr.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Six new binary quasi-cyclic codes
Linköping university. (Datalogi)ORCID iD: 0000-0002-2492-7754
1994 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, Vol. 40, no 5, 1666-1667 p.Article in journal (Refereed) Published
Abstract [en]

Six new quasi-cyclic codes are presented, which improve thelower bounds on the minimum distance for a binary code. A localexhaustive search is used to find these codes and many other quasi-cycliccodes which attain the lower bounds.

Place, publisher, year, edition, pages
1994. Vol. 40, no 5, 1666-1667 p.
Keyword [en]
Quasi-cyclic codes, best known binary codes, coding and codes
National Category
Computer Science
Identifiers
URN: urn:nbn:se:hkr:diva-6823DOI: 10.1109/18.333888ISI: A1994PT16700038OAI: oai:DiVA.org:hkr-6823DiVA: diva2:327531
Available from: 2010-06-29 Created: 2010-06-29 Last updated: 2014-03-24Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Chen, Eric Zhi
In the same journal
IEEE Transactions on Information Theory
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 45 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf