An Algorithm for Classification of Binary Self-Dual Codes

被引：17

作者：

Bouyuklieva, Stefka ^{[1
]}

Bouyukliev, Iliya ^{[2
]}

机构：

[1] Veliko Tarnovo Univ, Fac Math & Informat, Veliko Tarnovo 5000, Bulgaria

[2] Bulgarian Acad Sci, Inst Math & Informat, Veliko Tarnovo 5000, Bulgaria

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2012年 / 58卷 / 06期

关键词：

Classification; isomorph-free generation; self-dual codes; ENUMERATION; LENGTH;

D O I：

10.1109/TIT.2012.2190134

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

An efficient algorithm for classification of binary self-dual codes is presented. As an application, a complete classification of the self-dual codes of length 38 is given.

引用

页码：3933 / 3940

页数：8

共 24 条

[1]

Aguilar-Melchor C., IEEE T INF IN PRESS

[2]

Betsumiya K., ARXIV11043727

[3]

Bilous R.T., 2006, COMB MATH COMB COMPU, V59, P173

[4] An enumeration of binary self-dual codes of length 32 [J].

Bilous, RT ;

van Rees, GHJ .

DESIGNS CODES AND CRYPTOGRAPHY, 2002, 26 (1-3) :61-86

[5]

Bouyukliev I., 2007, CODING THEORY CRYPTO

[6]

Bouyukliev IG., 2007, SERDICA J COMPUT, V1, P115, DOI DOI 10.55630/SJC.2007.1.115-130

[7]

Cary Huffman., 2003, Fundamentals of Error-Correcting Codes

[8] ENUMERATION OF SELF-DUAL CODES [J].

CONWAY, JH ;

PLESS, V .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1980, 28 (01) :26-53

[9] THE BINARY SELF-DUAL CODES OF LENGTH UP TO 32 - A REVISED ENUMERATION [J].

CONWAY, JH ;

PLESS, V ;

SLOANE, NJA .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1992, 60 (02) :183-195

[10] A NEW UPPER BOUND ON THE MINIMAL DISTANCE OF SELF-DUAL CODES [J].

CONWAY, JH ;

SLOANE, NJA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (06) :1319-1333

← 1 2 3 →