Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes

TitleSome best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes
Publication TypeJournal Article
Year of Publication1991
AuthorsGulliver, T. A., and V. K. Bhargava
JournalInformation Theory, IEEE Transactions on
Volume37
Pagination552 -555
Date Publishedmay.
ISSN0018-9448
Keywordsbest code, binary codes, error correcting codes, error correction codes, linear codes, maximum possible minimum distance, nonexhaustive search, optimal code, power residue codes, rate (p-1)/p codes, rate 1/p codes, systematic quasi-cyclic codes
Abstract

Tables of 1/p and rate (p-1 )/p binary quasi-cyclic (QC) codes that extend previously published results are presented. Many of these codes attain bounds given by T. Verhoeff (1987), who composed a table of bounds on the maximum possible minimum distance of binary linear codes. Many of the codes presented meet or improve these bounds. A best code is considered to be one which has the largest possible minimum distance for the given code dimensions. n and k, and class of error correcting codes. A good code has the maximum known minimum distance for the class of codes. An optimal code is one that achieves the maximum possible minimum distance for a linear code with the same dimensions. Binary power residue codes are found and used to construct QC codes.

URLhttp://dx.doi.org/10.1109/18.79911
DOI10.1109/18.79911

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2020 The University of British Columbia