supported by National Natural Science Foundation of China(Grant No.11071163);Doctor Fund of Shandong Province(Grant No.BS2009SF017)
In this paper,we calculate the number of the codewords(with Hamming weight 7)of each type in the Preparata codes over Z4,then give the parameter sets of 3-designs constructed from the supports of the codewords of each...
financially supported by the TAMOP-4.2.1/B-09/1/KONV-2010-0005 project
Korchmaros and Nagy [Hermitian codes from higher degree places. J Pure Appl Algebra, doi: 10. 1016/j.jpaa.2013.04.002, 2013] computed the Weierstrass gap sequence G(P) of the Hermitian function field Fq2 (H) at a...
supported by the Singapore National Research Foundation(Grant No.NRF-CRP2-2007-03)
Algebraic manipulation detection codes are a cryptographic primitive that was introduced by Cramer et al. (Eurocrypt 2008). It encompasses several methods that were previously used in cheater detection in secret shari...
supported by National Key Basic Research Program of China(973 Program)(Grant No.2013CB834204);National Natural Science Foundation of China(Grant Nos.61171082 and 10990011)
Linear recurring sequences over finite fields play an important role in coding theory and cryptography. It is known that subfield subcodes of linear codes yield some good codes. In this paper, we study linear recurrin...
supported by projects MTM 2008-03339 from the Ministerio de Cienica e In,P07-FQM03128;FQM0211 from Junta de Andalucía and TEC 2009-13763-C02-02
We study indecomposable codes over a family of Hopf algebras introduced by Radford.We use properties of Hopf algebras to show that tensors of ideal codes are ideal codes,extending the corresponding result that was pre...
supported by National Natural Science Foundation of China (Grant No.10871079)
In this paper,we generalize the concept of Type Ⅱ codes to arbitrary finite rings. We focus on Type Ⅱ codes over finite chain rings and use the Chinese Remainder Theorem on these codes to study Type Ⅱ codes over pr...
the National Natural Foundation of China (Grant Nos. 10671140, 10626038)
Constant composition codes(CCCs)are a new generalization of binary constant weight codes and have attracted recent interest due to their numerous applications. In this paper, a new combinatorial approach to the constr...
This work was supported in part by the National Natural Science Foundation of China(Grant No.13071086).
In this paper, a type of combinatorial design (called difference packing array)is proposed and used to give a construction of systematic authentication codes. Taking advantage of this construction, some new series of ...
The first two authors were supported by the 973 Basic Research P rogram of China.
It is proved that any linear isomorphism between two linear codes which preserves a generalizedHamming weight is a monomial equivalence, which is an extension of a theorem of MacWilliams.
Some properties such as type, trace description, symmetrized weight enumerator, and generalizedHamming weights of the dual of quaternary Goethals codes are discussed. Furthermore, the shortened codesof quaternary Goet...