Abstract
To produce a highly nonlinear resilient function, the disjoint linear codes were originally proposed by Johansson and Pasalic in IEEE Trans. Inform. Theory, 2003, 49(2): 494–501. In this paper, an effective method for finding a set of such disjoint linear codes is presented. When n ⩾ 2k, we can find a set of [n,k]disjoint linear codes with cardinality 2n-k +⌊(n-k)/k⌊; When n < 2k, no set of disjoint linear codes exists with cardinality at least 2. We also describe a result on constructing a set of [n, k] disjoint linear codes with minimum distance at least some fixed positive integer.
Similar content being viewed by others
Explore related subjects
Discover the latest articles and news from researchers in related subjects, suggested using machine learning.References
Johansson T, Pasalic E. A construction of resilient functions with high nonlinearity. IEEE Transactions on Information Theory, 2003, 49(2): 494–501
Charpin P, Pasalic E. Highly nonlinear resilient functions through disjoint codes in projective spaces. Designs, Codes and Cryptography, 2005, 37(2): 319–346
Niederreiter H, Xing C. Disjoint linear codes from algebraic function fields. IEEE Transactions on Information Theory, 2004, 50(9):2174–2177
Lin S, Costello Jr D J. Error Control Coding: Fundamentals and Applications, 2nd ed. Upper Saddle River, NJ: Prentice-Hall, 2004
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, W., Cai, M. & Xiao, G. On constructing disjoint linear codes. Front. Comput. Sc. China 1, 226–230 (2007). https://doi.org/10.1007/s11704-007-0023-2
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11704-007-0023-2