AN UPDATED TABLE OF RATE 1/P BINARY QUASI-CYCLIC CODES

被引：4

作者：

GULLIVER, TA ^{[1
]}

BHARGAVA, VK ^{[1
]}

机构：

[1] UNIV VICTORIA,DEPT ELECT & COMP ENGN,VICTORIA,BC V8W 3P6,CANADA

来源：

APPLIED MATHEMATICS LETTERS | 1995年 / 8卷 / 05期

基金：

加拿大自然科学与工程研究理事会;

关键词：

QUASI-CYCLIC CODES; BOUNDS ON BINARY LINEAR CODES;

D O I：

10.1016/0893-9659(95)00071-W

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper, an updated table of maximum minimum distances for rate 1/p binary quasi-cyclic (QC) codes is presented. Many of the new codes given attain the bounds in the table by Brouwer and Verhoeff and the expanded table maintained by Brouwer, and fourteen of these codes improve the bounds. The generator polynomials of the new QC codes which provide table improvements are given. These codes were found using integer linear programming and a heuristic combinatorial optimization algorithm.

引用

页码：81 / 86

页数：6

共 9 条

[1] AN UPDATED TABLE OF MINIMUM-DISTANCE BOUNDS FOR BINARY LINEAR CODES
BROUWER, AE
VERHOEFF, T
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (02) : 662 - 677
[2] BROUWER AE, 1993, TABLE MINIMUM DISTAN
[3] 9 GOOD RATE (M-1) PM QUASI-CYCLIC CODES
GULLIVER, TA
BHARGAVA, VK
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (04) : 1366 - 1369
[4] SOME BEST RATE 1/P AND RATE (P-1)/P SYSTEMATIC QUASI-CYCLIC CODES
GULLIVER, TA
BHARGAVA, VK
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (03) : 552 - 555
[5] GULLIVER TA, 1993, IEEE T INF THEORY, V39
[6] GILBERT-VARSHAMOV BOUND FOR QUASI-CYCLIC CODES OF RATE 1-2
KASAMI, T
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (05) : 679 - 679
[7] Macwilliams F. J., 1977, THEORY ERROR CORRECT
[8] QUASI-CYCLIC CODES WITH RATE 1-M
VANTILBORG, H
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (05) : 628 - 630
[9] ZHI C, 1993, COMMUNICATION JAN

← 1 →