Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Des Codes Cryptogr

Search In Journal Title:

Abbravation: Designs, Codes and Cryptography

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1002/chin.200433271

Search In DOI:

ISSN

1573-7586

Search In ISSN:
Search In Title Of Papers:

The dimension of subcodesubfields of shortened ge

Authors: Fernando Hernando Kyle Marshall Michael E O’Sullivan
Publish Date: 2012/03/01
Volume: 69, Issue: 1, Pages: 131-142
PDF Link

Abstract

Reed–Solomon RS codes are among the most ubiquitous codes due to their good parameters as well as efficient encoding and decoding procedures However RS codes suffer from having a fixed length In many applications where the length is static the appropriate length can be obtained from an RS code by shortening or puncturing Generalized Reed–Solomon GRS codes are a generalization of RS codes whose subfieldsubcodes SFSC are extensively studied In this paper we show that a particular class of GRS codes produces many SFSC with large dimension We present two algorithms for searching through these codes and a list of new bestknown codes obtained


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:

  1. Composition of recursions and nonlinear complexity of periodic binary sequences
  2. Practical-time attacks against reduced variants of MISTY1
  3. On the largest affine sub-families of a family of NFSR sequences
  4. On explicit factors of cyclotomic polynomials over finite fields
  5. Two classes of optimal two-dimensional OOCs
  6. Sequences with small correlation
  7. Improved algorithms for finding low-weight polynomial multiples in $$\mathbb {F}_{2}^{}[x]$$ and some cryptographic applications
  8. A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
  9. Distinguisher-based attacks on public-key cryptosystems using Reed–Solomon codes
  10. A new table of permutation codes
  11. Bent functions embedded into the recursive framework of $${\mathbb{Z}}$$ -bent functions
  12. Nonexistence of CW (110, 100)
  13. Point compression for the trace zero subgroup over a small degree extension field
  14. The Diffie–Hellman problem and generalization of Verheul’s theorem
  15. Modular independence and generator matrices for codes over $${\mathbb {Z}_m}$$
  16. Improved lower bounds on sizes of single-error correcting codes
  17. A combinatorial problem related to sparse systems of equations
  18. Some results concerning cryptographically significant mappings over GF(2 n )
  19. A note on the reducibility of binary affine polynomials
  20. Primitive normal bases for quartic and cubic extensions: a geometric approach
  21. Computing isogenies between supersingular elliptic curves over $${\mathbb {F}}_p$$
  22. Some cyclic codes of length 2 p n
  23. On the correlation distribution of Delsarte–Goethals sequences
  24. Algebraic decoding of folded Gabidulin codes
  25. Inner balance of symmetric designs
  26. On the construction of Griesmer codes of dimension 5
  27. Applications of representation theory to wireless communications

Search Result: