Distance Distribution in Reed-Solomon Codes
From MaRDI portal
Publication:5123891
DOI10.1109/TIT.2019.2933625zbMath1448.11211OpenAlexW2966372995MaRDI QIDQ5123891
Publication date: 29 September 2020
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2019.2933625
Linear codes (general theory) (94B05) Bounds on codes (94B65) Polynomials over finite fields (11T06)
Related Items (5)
On the enumeration of polynomials with prescribed factorization pattern ⋮ Counting polynomials over finite fields with prescribed leading coefficients and linear factors ⋮ Subset sums over Galois rings. II ⋮ A new sieve for restricted multiset counting ⋮ Extensions of Schönemann's theorem in Galois rings
This page was built for publication: Distance Distribution in Reed-Solomon Codes