Albanian Journal of Mathematics (ISNN: 1930-1235), Vol 2, No 3 (2008)

Font Size:  Small  Medium  Large

Construction of linear codes having prescribed primal-dual minimum distance with applications in cryptography

A. Kohnert

Abstract


A method is given for the construction of linear codes with prescribed minimum distance and also prescribed minimum distance of the dual code. This works for codes over arbitrary finite fields. In the case of binary codes Matsumoto et al. showed how such codes can be used to construct cryptographic Boolean functions. This new method allows to compute new bounds on the size of such codes, extendind the table of Matsumoto et al..

Full Text: PDF

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.