Computing coset leaders and leader codewords of binary codes

被引：3

作者：

Borges-Quintana, M. ^{[1
]}

Borges-Trenard, M. A. ^{[1
]}

Marquez-Corbella, I. ^{[2
,3
]}

Martinez-Moro, E. ^{[4
]}

机构：

[1] Univ Oriente, Dept Math, Fac Math & Comp Sci, Santiago De Cuba, Cuba

[2] Ecole Polytech, INRIA Saclay, GRACE Project, F-91120 Palaiseau, France

[3] Ecole Polytech, LIX CNRS UMR 7161, F-91120 Palaiseau, France

[4] Univ Valladolid, Inst Math IMUVa, Valladolid, Castilla, Spain

来源：

JOURNAL OF ALGEBRA AND ITS APPLICATIONS | 2015年 / 14卷 / 08期

关键词：

Binary codes; coset leaders; test set; Grobner representation;

D O I：

10.1142/S0219498815501285

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper we use the Grobner representation of a binary linear code C to give efficient algorithms for computing the whole set of coset leaders, denoted by CL(C) and the set of leader codewords, denoted by L(C). The first algorithm could be adapted to provide not only the Newton and the covering radius of C but also to determine the coset leader weight distribution. Moreover, providing the set of leader codewords we have a test-set for decoding by a gradientlike decoding algorithm. Another contribution of this article is the relatione established between zero neighbors and leader codewords.

引用

页数：19

共 50 条

[21] Sphere-bound-achieving coset codes and multilevel coset codes
Forney, GD
Trott, MD
Chung, SY
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (03) : 820 - 850
[22] On those Boolean functions that are coset leaders of first order Reed-Muller codes
Carlet, Claude
Feukoua, Serge
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2024, 92 (01) : 7 - 27
[23] On those Boolean functions that are coset leaders of first order Reed-Muller codes
Claude Carlet
Serge Feukoua
Annals of Mathematics and Artificial Intelligence, 2024, 92 : 7 - 27
[24] COSET CODES FOR PARTIAL RESPONSE CHANNELS - OR, COSET CODES WITH SPECTRAL NULLS
FORNEY, GD
CALDERBANK, AR
IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (05) : 925 - 943
[25] ON THE NON-MINIMALITY OF THE LARGEST WEIGHT CODEWORDS IN THE BINARY REED-MULLER CODES
Klein, Andreas
Storme, Leo
ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2011, 5 (02) : 333 - 337
[26] A tree based algorithm for generating all possible binary compact codes with N codewords
Khosravifard, M
Esmaeili, M
Saidi, H
Gulliver, TA
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2003, E86A (10) : 2510 - 2516
[27] Burst error correcting binary cyclic AN codes consisting 2(m)-1 codewords
Murakami, R
Okura, Y
Shimada, R
ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1996, 79 (08): : 15 - 22
[28] On the stabilizers of the minimum-weight codewords of some binary codes from graphs on triples
Rodrigues, B. G.
QUAESTIONES MATHEMATICAE, 2007, 30 (01) : 21 - 26
[29] Construction of Short Binary QC-LDPC Codes: Cyclotomic Coset Approach
Zhang, Yanjing
Zhang, Lijun
PROCEEDINGS OF 2012 IEEE 11TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING (ICSP) VOLS 1-3, 2012, : 1439 - 1442
[30] Coset distribution of triple-error-correcting binary primitive BCH codes
Charpin, P
Helleseth, T
Zinoviev, V
2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, 2005, : 1972 - 1976

← 1 2 3 4 5 →