Search

Showing total 12 results
12 results

Search Results

1. Shortened Linear Codes From APN and PN Functions.

2. The q -Ary Antiprimitive BCH Codes.

3. Binary [ n , (n + 1)/2] Cyclic Codes With Good Minimum Distances.

4. The Subfield Codes and Subfield Subcodes of a Family of MDS Codes.

5. Infinite Families of Linear Codes Supporting More t -Designs.

6. Twisted Reed–Solomon Codes.

7. A Generic Transformation for Optimal Node Repair in MDS Array Codes Over F 2.

8. Almost-Reed–Muller Codes Achieve Constant Rates for Random Errors.

9. Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound.

10. Decoherence-Insensitive Quantum Communication by Optimal C*-Encoding.

11. On Rosenbloom and Tsfasman's generalization of the Hamming space

12. A QUESTION CONCERNING THE FACTORIZATION OF CYCLIC GROUPS.