Skip to main content
Top
Published in: Designs, Codes and Cryptography 1-2/2017

08-07-2016

MacWilliams Extension Theorem for MDS codes over a vector space alphabet

Author: Serhii Dyshko

Published in: Designs, Codes and Cryptography | Issue 1-2/2017

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The MacWilliams Extension Theorem states that each linear isometry of a linear code extends to a monomial map. Unlike the linear codes, in general, nonlinear codes do not have the extension property. In our previous work, in the context of a vector space alphabet, the minimum code length, for which there exists an unextendable code isometry, was determined. In this paper an analogue of the extension theorem for MDS codes is proved. It is shown that for almost all, except 2-dimensional, linear MDS codes over a vector space alphabet the extension property holds. For the case of 2-dimensional MDS codes an improvement of our general result is presented. There are also observed extension properties of near-MDS codes. As an auxiliary result, a new bound on the minimum size of multi-fold partitions of a vector space is obtained.
Literature
2.
7.
go back to reference Dyshko S.: Minimal nontrivial solutions of the isometry equation. arXiv:1501.02470. Manuscript submitted for publication in Discrete Mathematics. Dyshko S.: Minimal nontrivial solutions of the isometry equation. arXiv:​1501.​02470. Manuscript submitted for publication in Discrete Mathematics.
9.
10.
go back to reference Greferath M., Nechaev A., Wisbauer R.: Finite quasi-Frobenius modules and linear codes. J. Algebra Appl. 03(03), 247–272 (2004). Greferath M., Nechaev A., Wisbauer R.: Finite quasi-Frobenius modules and linear codes. J. Algebra Appl. 03(03), 247–272 (2004).
12.
go back to reference MacWilliams F.J.: Combinatorial properties of elementary abelian groups. Ph.D. Thesis, Radcliffe College (1962). MacWilliams F.J.: Combinatorial properties of elementary abelian groups. Ph.D. Thesis, Radcliffe College (1962).
13.
go back to reference MacWilliams F., Sloane N.: The Theory of Error-Correcting Codes. North-Holland Mathematical Library, vol. 1. North-Holland, Amsterdam (1977). MacWilliams F., Sloane N.: The Theory of Error-Correcting Codes. North-Holland Mathematical Library, vol. 1. North-Holland, Amsterdam (1977).
14.
go back to reference Solov’eva F., Honold T., Avgustinovich S., Heise W.: On the extendability of code isometries. J. Geom. 61(1–2), 2–16 (1998). doi:10.1007/BF01237489. Solov’eva F., Honold T., Avgustinovich S., Heise W.: On the extendability of code isometries. J. Geom. 61(1–2), 2–16 (1998). doi:10.​1007/​BF01237489.
15.
go back to reference Wood J.A.: Foundations of linear codes defined over finite modules: the extension theorem and the MacWilliams identities. Codes Over Rings. Series on Coding Theory and Cryptology, pp. 124–190. World Scientific Publications, Hackensack (2009). doi:10.1142/9789812837691_0004. Wood J.A.: Foundations of linear codes defined over finite modules: the extension theorem and the MacWilliams identities. Codes Over Rings. Series on Coding Theory and Cryptology, pp. 124–190. World Scientific Publications, Hackensack (2009). doi:10.​1142/​9789812837691_​0004.
Metadata
Title
MacWilliams Extension Theorem for MDS codes over a vector space alphabet
Author
Serhii Dyshko
Publication date
08-07-2016
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 1-2/2017
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-016-0247-y

Other articles of this Issue 1-2/2017

Designs, Codes and Cryptography 1-2/2017 Go to the issue

Premium Partner