Construction of self-dual matrix codes

Citations

WEB OF SCIENCE

2
Citations

SCOPUS

2

초록

Matrix codes over a finite field F-q are linear codes defined as subspaces of the vector space of m x n matrices over F-q. In this paper, we show how to obtain self-dual matrix codes from a self-dual matrix code of smaller size using a method we call the building-up construction. We show that every self-dual matrix code can be constructed using this building-up construction. Using this, we classify, that is, we find a complete set of representatives for the equivalence classes of self-dual matrix codes of small sizes. In particular we have classifications for self-dual matrix codes of sizes 2 x 4, 2 x 5 over F-2, of size 2 x 3, 2 x 4 over F-4, of size 2 x 2, 2 x 3 over F-8, and of size 2 x 2, 2 x 3 over F-13, all of which have been left open from K. Morrison's classification.

키워드

Matrix codeSelf-dual codeClassificationSPACE-TIME CODESENUMERATIONEQUIVALENCECLASSIFICATION
제목
Construction of self-dual matrix codes
저자
Galvez, Lucky ErapKim, Jon-Lark
DOI
10.1007/s10623-020-00740-z
발행일
2020-08
유형
Article
저널명
Designs, Codes, and Cryptography
88
8
페이지
1541 ~ 1560