New results on binary quasi-cyclic codes 2000 (English)In: 2000 Ieee International Symposium on Information Theory: Proceedings, IEEE conference proceedings, 2000, p. 197-Conference paper, Published paper (Refereed)

Abstract [en]

Twelve new binary quasi-cyclic codes, which improve the lower bounds on minimum distances for binary linear codes, are presented, and a Web database on best-known binary quasi-cyclic codes is constructed for public access.

Place, publisher, year, edition, pages

IEEE conference proceedings, 2000. p. 197-

Keywords [en]

codes and coding, quasi-cyclic codes, optimal codes

National Category

Computer Sciences

Identifiers

URN: urn:nbn:se:hkr:diva-6830DOI: 10.1109/ISIT.2000.866495ISI: 000168322900193ISBN: 0-7803-5857-0 (print)OAI: oai:DiVA.org:hkr-6830DiVA, id: diva2:327554

Conference

2000 IEEE International Symposium on Information Theory, Sorrento, 25-30 June, 2000

Available from: 2010-06-29 Created: 2010-06-29 Last updated: 2018-01-12Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Chen, Eric Zhi

Search in DiVA

By author/editor

Chen, Eric Zhi

By organisation

Avdelningen för Design och datavetenskap

On the subject

Computer Sciences

Search outside of DiVA

GoogleGoogle ScholarTotal: 52 hits