On a new code, [2ⁿ - 1,n,2ⁿ - 1]
From MaRDI portal
Publication:1003689
In this paper, a new binary linear \([2^n-1, n, 2^{n-1}]\) code is developed. A systematic generator matrix of the new code is designed. The error capability of this code is \(2^{n-2}-1\). It is shown that the minimum weighted codewords of this code hold \(2-(2^n-1, 2^{n-1}, 2^{n-2})\) design, and do not hold 3-design. Also, some other properties of this code are stated and proved.
Recommendations
- Square designs on new binary \(\left(\frac{3^n-1}{2}, \frac{3^n-1}{2}, 2.3^{n-2}\right)\) codes
- Square designs on a family of new binary \(\left(\frac{p^n-1}{p-1},\frac{p^n-1}{p-1}, 2p^{n-2}\right)\) codes
- New binary linear codes
- New $[47,15,16]$ Linear Binary Block Code
- Two new nonlinear binary codes
Cites work
Cited in
(4)- Pairwise balanced design of order 6n+4 and 2-fold system of order 3n+2
- Square designs on a family of new binary \(\left(\frac{p^n-1}{p-1},\frac{p^n-1}{p-1}, 2p^{n-2}\right)\) codes
- Square designs on new binary \(\left(\frac{3^n-1}{2}, \frac{3^n-1}{2}, 2.3^{n-2}\right)\) codes
- Modified linear block code with code rate 1/2 and less than 1/2
This page was built for publication: On a new code, \([2^n - 1,n,2^{n - 1}]\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003689)
