SOME BEST RATE 1/P AND RATE (P-1)/P SYSTEMATIC QUASI-CYCLIC CODES

Authors
  1. Gulliver, T.A.
  2. Bhargava, V.K.
Corporate Authors
Defence Research Establishment Ottawa, Ottawa ONT (CAN);Victoria Univ, Victoria BC (CAN) Dept of Electrical and Computer Engineering;Carleton Univ, Ottawa ONT (CAN) Dept of Systems and Computer Engineering
MONITOR AGENCY
Natural Sciences and Engineering Research Council of Canada, Ottawa ONT (CAN)
Abstract
Tables of rate 1/p and (p-1)/p binary quasi-cyclic (QC) codes that extend previously published results are presented. Many of these codes attain the bounds given by Verhoeff and some improve the bounds. Binary power residue codes are found and used to construct QC codes.
Date of publication
15 Sep 1990
Number of Pages
4
Reprinted from
IEEE Transactions on Information Theory, vol 37, no 3, 1991, p 552-555
DSTKIM No
92-00883
CANDIS No
103777
Format(s):
Hardcopy;Originator's fiche received by DSIS

Permanent link

Document 1 of 1

Date modified: