Distance Distribution in Reed-Solomon Codes
From MaRDI portal
Publication:5123891
Recommendations
- On the distance distribution of codes
- On error distance of Reed-Solomon codes
- Bounds on distance distributions in codes of given size
- Distance Distribution of Binary Codes and the Error Probability of Decoding
- Error distance of standard Reed-Solomon codes
- Computing error distance of Reed-Solomon codes
- Estimates of the distance distribution of codes and designs
- Estimates of the distance distribution of codes and designs
- Bounds on Distance Distributions in Codes of Known Size
- Estimates of the distance distribution of nonbinary codes, with applications
Cited in
(11)- A new sieve for restricted multiset counting
- Extensions of Schönemann's theorem in Galois rings
- On the enumeration of polynomials with prescribed factorization pattern
- Distance distributions of cyclic orbit codes
- Counting polynomials over finite fields with prescribed leading coefficients and linear factors
- Estimates of the distance distribution of codes and designs
- Estimates of the distance distribution of codes and designs
- Subset sums over Galois rings. II
- Asymptotic distributions of the number of zeros of random polynomials in Hayes equivalence class over a finite field
- Counting polynomials with distinct zeros in Galois ring \(\mathrm{GR}(p^2,r)\)
- Smooth symmetric systems over a finite field and applications
This page was built for publication: Distance Distribution in Reed-Solomon Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5123891)
