[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.4134/BKMS.b150738

THE t-WISE INTERSECTION OF RELATIVE THREE-WEIGHT CODES

Li, Xin (Department of Mathematics Beijing Institute of Technology)
Liu, Zihui (Department of Mathematics Beijing Institute of Technology)

Publication Information

Bulletin of the Korean Mathematical Society / v.54, no.4, 2017 , pp. 1095-1110 More about this Journal

Abstract

The t-wise intersection is a useful property of a linear code due to its many applications. Recently, the second author determined the t-wise intersection of a relative two-weight code. By using this result and generalizing the finite projective geometry method, we will present the t-wise intersection of a relative three-weight code and its applications in this paper.

Keywords

relative three-weight code; t-wise intersecting; relative two-weight code; constant-weight code; projective subspace; value assignment;

Citations & Related Records

Reference

1	A. Ashikhmin and A. Barg, Minimal vectors in linear codes, IEEE Trans. Inform. Theory 44 (1998), no. 5, 2010-2017. DOI
2	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
3	G. Cohen, S. Encheva, S. Litsyn, and H. G. Schaathum, Intersecting codes and separating codes, Discrete Appl. Math. 128 (2003), no. 1, 75-83. DOI
4	G. Cohen and A. Lempel, Linear intersecting codes, Discrete Math. 56 (1985), no. 1, 35-43. DOI
5	G. Cohen and H. G. Schaathun, Upper bounds on separating codes, IEEE Trans. Inform. Theory 50 (2004), no. 6, 1291-1295. DOI
6	G. Cohen and G. Zemor, Intersecting codes and independent families, IEEE Trans. Inform. Theory 40 (1994), 1872-1881. DOI
7	S. Encheva and G. Cohen, Constructions of intersecting codes, IEEE Trans. Inform. Theory 45 (1999), no. 4, 1234-1237. DOI
8	Z. H. Liu, The t-wise intersection of relative two weight codes, Sci. China Math. 57 (2014), no. 8, 1765-1770. DOI
9	Z. H. Liu and X. W. Wu, On relative constant-weight codes, Des. Codes Cryptogr. 75 (2015), no. 1, 127-144. DOI
10	G. B. Rassard, C. Crepeau, and J. M. Robert, Information-theoretic reductions among disclosure problems, Proc. 27th IEEE Symp. Foundat. Comput. Sci. (1986), 168-173.