On a new code, [2n−1,n,2n−1][2n−1,n,2n−1]

A binary linear code in F2n with dimension kk and minimum distance dd is called an [n,k,d][n,k,d] code. A t-(n,m,λ)t-(n,m,λ) design DD is a set XX of nn points together with a collection of mm-subsets of XX (called a block) such that every tt-subset of XX is contained in exactly λλ blocks. A constant length code which corrects different numbers of errors in different code words is called a non-uniform error correcting code. Parity sectioned reduction of a linear code gives a non-uniform error correcting code. In this paper a new code, [2n−1,n,2n−1][2n−1,n,2n−1], is developed. The error correcting capability of this code is 2n−2−1=e2n−2−1=e. It is shown that this code holds a 2-(2n−1,2n−1,2n−2)2-(2n−1,2n−1,2n−2) design. Also the parity sectioned reduction code after deleting the same g(≤e) positions of each code word of this code holds a 1-(2n−1−g,2n−1−j,Cjg.2n−1−g) design for n≥3,g=1,2,…,en≥3,g=1,2,…,e and j=0,1,…,gj=0,1,…,g.