The following pages link to Ron M. Roth (Q540380):
Displaying 50 items.
- On linear balancing sets (Q540382) (← links)
- Spectral-null codes and null spaces of Hadamard submatrices (Q679429) (← links)
- Probabilistic algorithm for finding roots of linearized polynomials (Q1008961) (← links)
- \(t\)-sum generators of finite Abelian groups (Q1195479) (← links)
- On the number of factorizations of polynomials over finite fields (Q2037165) (← links)
- On runlength-limited coding with DC control (Q2732975) (← links)
- New Bounds and Constructions for Granular Media Coding (Q2977328) (← links)
- Long Cyclic Codes Over GF(4) and GF(8) Better Than BCH Codes in the High-Rate Region (Q2979086) (← links)
- Coding for Combined Block–Symbol Error Correction (Q2986382) (← links)
- Bounds and Constructions for Granular Media Coding (Q2986426) (← links)
- (Q3128894) (← links)
- On the decoding delay of encoders for input-constrained channels (Q3129479) (← links)
- Bounds on the number of states in encoder graphs for input-constrained channels (Q3356224) (← links)
- Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$ (Q3359132) (← links)
- On MDS codes via Cauchy matrices (Q3472046) (← links)
- Improved Bit-Stuffing Bounds on Two-Dimensional Constraints (Q3546974) (← links)
- Lowest density MDS codes over extension alphabets (Q3547268) (← links)
- Symbol-Intersecting Codes (Q3547566) (← links)
- Improved Nearly-MDS Expander Codes (Q3548010) (← links)
- Bounds for Binary Codes With Narrow Distance Distributions (Q3549013) (← links)
- On the Hardness of Decoding the Gale–Berlekamp Code (Q3604688) (← links)
- On generator matrices of MDS codes (Corresp.) (Q3713990) (← links)
- On cyclic MDS codes of length q over GF(q) (Corresp.) (Q3722419) (← links)
- On MDS extensions of generalized Reed- Solomon codes (Q3726007) (← links)
- Encoding and decoding of BCH codes using light and short codewords (Q3799954) (← links)
- Composition of Reed-Solomon codes and geometric designs (Q3804609) (← links)
- A construction of non-Reed-Solomon type MDS codes (Q3832466) (← links)
- Application of circulant matrices to the construction and decoding of linear codes (Q3986488) (← links)
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs (Q3990791) (← links)
- Improved Gilbert-Varshamov bound for constrained systems (Q4014137) (← links)
- New array codes for multiple phased burst correction (Q4034432) (← links)
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference (Q4210077) (← links)
- (Q4242027) (← links)
- Constructions of permutation arrays for certain scheduling cost measures (Q4322473) (← links)
- Lee-metric BCH codes and their application to constrained and partial-response channels (Q4324169) (← links)
- Optimal File Sharing in Distributed Networks (Q4326860) (← links)
- Tensor codes for the rank metric (Q4336395) (← links)
- Probabilistic crisscross error correction (Q4371885) (← links)
- Is code equivalence easy to decide? (Q4371902) (← links)
- Efficient encoding algorithm for third-order spectral-null codes (Q4400304) (← links)
- Bounds on the List-Decoding Radius of Reed--Solomon Codes (Q4443130) (← links)
- Nested input-constrained codes (Q4501748) (← links)
- Two-dimensional weight-constrained codes through enumeration bounds (Q4501749) (← links)
- Efficient decoding of Reed-Solomon codes beyond half the minimum distance (Q4503508) (← links)
- Efficient coding schemes for the hard-square model (Q4544549) (← links)
- Nested block decodable runlength-limited codes (Q4544603) (← links)
- Lower bounds on the anticipation of encoders for input-constrained channels (Q4544623) (← links)
- Lossless sliding-block compression of constrained systems (Q4545762) (← links)
- On Decoding Rank-Metric Codes Over Large Fields (Q4566678) (← links)
- Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints (Q4652611) (← links)
