Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes
From MaRDI portal
Publication:2306902
DOI10.1007/S10623-019-00701-1zbMATH Open1454.94123arXiv1907.13032OpenAlexW2996271523WikidataQ126591664 ScholiaQ126591664MaRDI QIDQ2306902FDOQ2306902
Authors: Cunsheng Ding, Chun-Ming Tang, Vladimir D. Tonchev 
Publication date: 27 March 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Abstract: In this paper, the 3-rank of the incidence matrices of 2-designs supported by the minimum weight codewords in a family of ternary linear codes considered in [C. Ding, C. Li, Infinite families of 2-designs and 3-designs from linear codes, Discrete Mathematics 340(10) (2017) 2415--2431] are computed. A lower bound on the minimum distance of the ternary codes spanned by the incidence matrices of these designs is derived, and it is proved that the codes are subcodes of the 4th order generalized Reed-Muller codes.
Full work available at URL: https://arxiv.org/abs/1907.13032
Recommendations
Cites Work
- New 5-designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fundamentals of Error-Correcting Codes
- Title not available (Why is that?)
- On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- The dimension of projective geometry codes
- Some results on cyclic codes which are invariant under the affine group and their applications
- Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+1\) over \(\mathbb F_2\)
- Remark on ``Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+1\) over \(\mathbb F_2\)
- A formula for the number of Steiner quadruple systems on 2n points of 2‐rank 2n−n
- A mass formula for Steiner triple systems STS\((2^n-1)\) of 2-rank \(2^n-n\)
- Title not available (Why is that?)
- Structure of Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+2\) over \(\mathbb F_2\)
- On the number of Steiner triple systems \(S(2^m - 1, 3, 2)\) of rank \(2^m - m + 2\) over \(\mathbb{F}_2\)
- Title not available (Why is that?)
- Counting Steiner triple systems with classical parameters and prescribed rank
- The classification of Steiner triple systems on 27 points with 3-rank 24
- There are 1239 Steiner triple systems \(STS(31)\) of 2-rank 27
- Infinite families of 2-designs and 3-designs from linear codes
- Quasi-symmetric designs, codes, quadrics, and hyperplane sections
- Codes cycliques étendus affines-invariants et antichaines d'un ensemble partiellement ordonné. (Affine-invariant extended cyclic codes and antichains of a partially ordered set.)
- A coding theoretic approach to extending designs
Cited In (13)
- On binary linear codes supporting t-designs
- Some optimal codes from designs
- The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes
- Some 3-designs and shortened codes from binary cyclic codes with three zeros
- Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)
- Another generalisation of the binary Reed-Muller codes and its applications
- Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions
- Linear codes from support designs of ternary cyclic codes
- Linear codes of 2-designs as subcodes of the generalized Reed-Muller codes
- An infinite family of antiprimitive cyclic codes supporting Steiner systems \(S(3,8, 7^m+1)\)
- Designs from subcode supports of linear codes
- Tricolore 3-designs in type III codes
- 3-(2m, 2m–1, 2m–2–1) design for first order Reed-Muller code R(1,m)
This page was built for publication: Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2306902)
