Browse > Article
http://dx.doi.org/10.4134/BKMS.2016.53.1.263

ON THE SEPARATION OF LINEAR CONSTANT-WEIGHT CODES  

Liu, Zihui (Department of Mathematics Beijing Institute of Technology)
Publication Information
Bulletin of the Korean Mathematical Society / v.53, no.1, 2016 , pp. 263-272 More about this Journal
Abstract
By using the finite projective geometry method, the separating properties of linear constant-weight codes are presented. An algorithm is given for computing the cardinality of separating coordinate positions of certain disjoint codeword sets of linear constant-weight codes.
Keywords
feasible set; separating property; intersection number; value assignment; disjoint codeword sets;
Citations & Related Records
연도 인용수 순위
  • Reference
1 W. D. Chen and T. Klove, The weight hierarchies of q-ary codes of dimension 4, IEEE Trans. Inform. Theory 42 (1996), no. 6, 2265-2272.   DOI
2 G. Cohen, S. Encheva, S. Litsyn, and H. G. Schaathun, Intersecting codes and separating codes, Discrete Appl. Math. 128 (2003), no. 1, 75-83.   DOI
3 G. Cohen, S. Encheva, and H. G. Schaathun, More on (2, 2)-separating systems, IEEE Trans. Inform. Theory 48 (2002), no. 9, 2606-2609.   DOI
4 G. Cohen and G. Zemor, Intersecting codes and independent families, IEEE Trans. Inform. Theory 40 (1994), 1872-1881.   DOI
5 S. Encheva and G. Cohen, Constructions of intersecting codes, IEEE Trans. Inform. Theory 45 (1999), no. 4, 1234-1237.   DOI
6 Z. H. Liu andW. D. Chen, Notes on the value function, Des. Codes Cryptogr. 54 (2010), no. 1, 11-19.   DOI
7 J. A. Wood, The structure of linear codes of constant weight, Trans. Amer. Math. Soc. 354 (2002), no. 3, 1007-1026.   DOI
8 J. A. Wood, Relative one-weight linear codes, Des. Codes Cryptogr. 72 (2014), no. 2, 331-344.   DOI