A class of q-ary (q 2 3) codes is constructed from nested balanced incomplete block designs. Proof. (See Table 1.) Let an initial block of cyclic solution of the nested BIBD be arranged as (x I,X~Y..
On a class of Abelian codes
β Scribed by Prabir Bhattacharya
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 371 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0020-0255
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We build a class of codes using hermitian forms and the functional trace code. Then we give a general expression of the rth minimum distance of our code and compute general bounds for the weight hierarchy by using exponential sums. We also get the minimum distance and calculate the rth generalized H
A lattice-ordered abelian group is called ultrasimplicial iff every finite set of positive elements belongs to the monoid generated by some finite set of positive Z-independent elements. This property originates from Elliott's classification of AF C U -algebras. Using fans and their desingularizatio