JOURNAL BROWSE
Search
Advanced SearchSearch Tips
ON THE SEPARATION OF LINEAR CONSTANT-WEIGHT CODES
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
ON THE SEPARATION OF LINEAR CONSTANT-WEIGHT CODES
Liu, Zihui;
  PDF(new window)
 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;
 Language
English
 Cited by
 References
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. crossref(new window)

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. crossref(new window)

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. crossref(new window)

4.
G. Cohen and G. Zemor, Intersecting codes and independent families, IEEE Trans. Inform. Theory 40 (1994), 1872-1881. crossref(new window)

5.
S. Encheva and G. Cohen, Constructions of intersecting codes, IEEE Trans. Inform. Theory 45 (1999), no. 4, 1234-1237. crossref(new window)

6.
Z. H. Liu andW. D. Chen, Notes on the value function, Des. Codes Cryptogr. 54 (2010), no. 1, 11-19. crossref(new window)

7.
J. A. Wood, The structure of linear codes of constant weight, Trans. Amer. Math. Soc. 354 (2002), no. 3, 1007-1026. crossref(new window)

8.
J. A. Wood, Relative one-weight linear codes, Des. Codes Cryptogr. 72 (2014), no. 2, 331-344. crossref(new window)