26 March 2018 in IEEE Transactions on Information Theory
In addition to their applications in data communication and storage, linear codes also have nice applications in combinatorics and cryptography. Minimal linear codes, a special type of linear codes, are preferred in secret sharing. In this paper, a necessary and sufficient condition for a binary linear code to be minimal is derived. This condition enables us to obtain three infinite families of minimal binary linear codes with wmin/wmax ≤ 1/2 from a generic construction, where wmin and wmax respectively denote the minimum and maximum nonzero weights in a code. The weight distributions of all these minimal binary linear codes are also determined.
10 July 2015 in IEEE Communications Letters
In this letter, we use Gauss sums of index 2 to construct a class of new binary linear codes with at most three weights. In special cases, they are optimal or near optimal codes. These codes can be used in authentication codes and secret sharing schemes.
3 July 2020 in IEEE Transactions on Information Theory
In this paper, a family of [q2-1,4,q2 -q-2] cyclic codes over 픽q meeting the Griesmer bound is presented. Their duals are [q2-1,q2-5,4] almost MDS codes and are optimal with respect to the sphere-packing bound. The q0-ary subfield codes of this family of cyclic codes are also investigated, where q0 is any prime power such that q is power of q0. Some of the subfield codes are optimal and some have the best known parameters. It is shown that the subfield codes are equivalent to a family of primitive BCH codes and thus the parameters of the BCH codes are solved. The duals of the subfield codes are also optimal with respect to the sphere-packing bound. A family of [q2,4,q2-q-1] linear codes over 픽q meeting the Griesmer bound is presented. Their duals are [q2,q2-4,4] almost MDS codes and are optimal with respect to the sphere-packing bound. The q0-ary subfield codes of this family of linear codes are also investigated, where q0 is any prime power such that q is power of q0. Five infinite families of 2-designs are also constructed with three families of linear codes of this paper.
25 March 2019 in IEEE Transactions on Information Theory
Ovoids in PG(3,GF(q)) have been an interesting topic in coding theory, combinatorics, and finite geometry for a long time. So far only two families of ovoids are known. The first is the elliptic quadrics and the second is the Tits ovoids. It is known that an ovoid in PG(3,GF(q)) corresponds to a [q 2+1, 4, q 2 -q] code over GF(q), which is called an ovoid code. The objectives of this paper are to develop general theories of subfield codes and to study the subfield codes of the two families of ovoid codes. The dimensions, minimum weights, and the weight distributions of the subfield codes of the elliptic quadric codes and Tits ovoid codes are settled. The parameters of the duals of these subfield codes are also studied. Some of the codes presented in this paper are optimal, and some are distance-optimal. The parameters of the subfield codes are new.
12 April 2017 in IEEE Transactions on Information Theory
In practical applications, such as direct spread code division multiple access communications, space-time codes and compressed sensing, and codebooks with small inner-product correlation are required. It is extremely difficult to construct codebooks achieving the Levenshtein bound. In this paper, two new constructions of infinitely many codebooks with multiplicative characters of finite fields are presented. These constructions produce complex codebooks asymptotically achieving the Levenshtein bound and codebooks asymptotically achieving the Welch bound. The codebooks presented in this paper have new parameters.
30 January 2020 in IEEE Transactions on Information Theory
The binary Hamming codes with parameters [2m – 1, 2m – 1 – m, 3] are perfect. Their extended codes have parameters [2m; 2m–1–m, 4] and are distance-optimal. The first objective of this paper is to construct a class of binary linear codes with parameters [2m+s +2s–2m, 2m+s +2s–2m–2m–2, 4], which have better information rates than the class of extended binary Hamming codes, and are also distance-optimal. The second objective is to construct a class of distance-optimal binary codes with parameters [2m+2, 2m–2m; 6. Both classes of binary linear codes have new parameters.