Construction of self-orthogonal codes from combinatorial designs
type: Item
instance of: scholarly article
title: Construction of self-orthogonal codes from combinatorial designs
zbMATH Open document ID: 1267.94137
DOI: 10.1134/S0032946012030052
author: Yanyan Li
published in: Problems of Information Transmission
publication date: 2013-01-02T00:00:00Z
review text: Consider binary linear codes generated by matrices of the form \([I\;A]\), where \(I\) is an identity matrix. Self-orthogonal such codes can be obtained by letting \(A\) be a part (obtained by removing some rows, if necessary) of the incidence matrix of a \(2\)-\((v,k,\lambda)\) BIBD for certain sets of parameters. There is also another variant of this construction that gives self-orthogonal codes. The authors construct codes via a classification of the matrices \(A\), that is, parts of BIBDs with given small parameters. Well-established techniques are used in this classification. The number of isomorphism classes of codes obtained in this manner as well as the minimum distance of the codes are tabulated for 13 sets of parameters of the underlying BIBD.
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 05B05
Mathematics Subject Classification ID: 94B25
zbMATH DE Number: 6121281
zbMATH Keywords: BIBD
zbMATH Keywords: linear code
zbMATH Keywords: self-orthogonal code
reviewed by: Patric R. J. Östergård
describes a project that uses: Q-extension
describes a project that uses: Code Tables
MaRDI profile type: Publication
cites work: Q5295614
cites work: Classification algorithms for codes and designs
cites work: Fundamentals of Error-Correcting Codes
cites work: Some new results for optimal ternary linear codes
cites work: Q3511531
description: scientific article; zbMATH DE number 6121281