Twelve good rate (m-r)/pm quasi-cyclic codes

TitleTwelve good rate (m-r)/pm quasi-cyclic codes
Publication TypeJournal Article
Year of Publication1993
AuthorsGulliver, T. A., and V. K. Bhargava
JournalInformation Theory, IEEE Transactions on
Volume39
Pagination1750 -1751
Date Publishedsep.
ISSN0018-9448
Keywordsbinary linear codes, bounds, circulant matrices, cyclic codes, heuristic combinatorial optimization, matrix algebra, optimisation, quasicyclic codes
Abstract

Twelve new quasi-cyclic (QC) codes are presented which improve the bounds on the best known binary linear codes. They are rate (m-r)/pm, r gt;1, codes constructed by deleting r rows from the circulant matrices of rate m/pm QC codes, based on the factors of xm-1. Heuristic combinatorial optimization was used to find these codes
URLhttp://dx.doi.org/10.1109/18.259670
DOI10.1109/18.259670

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 2021 The University of British Columbia