39 results on '"M., Roth"'
Search Results
2. On the Implementation of Boolean Functions on Content-Addressable Memories.
3. Higher-Order MDS Codes.
4. Asymptotic Bounds on the Rate of Locally Repairable Codes.
5. On the Number of Factorizations of Polynomials over Finite Fields.
6. On Parity-Preserving Variable-Length Constrained Coding.
7. The Capacity of Count-Constrained ICI-Free Systems.
8. Analog Error-Correcting Codes.
9. On Parity-Preserving Constrained Coding.
10. Fault- Tolerant Dot-Product Engines.
11. On decoding rank-metric codes over large fields.
12. On the pointwise threshold behavior of the binary erasure polarization subchannels.
13. On spectral design methods for quasi-cyclic codes.
14. Long cyclic codes over GF(4) and GF(8) better than BCH codes in the high-rate region.
15. Improved burst error correction via list decoding quasi-cyclic codes.
16. On the capacity of generalized Ising channels.
17. New upper bounds for grain-correcting and grain-detecting codes.
18. When data must satisfy constraints upon writing.
19. Hamming-weight constrained coded arrays based on covering codes.
20. Coding for combined block-symbol error correction.
21. Burst list decoding of interleaved Reed-Solomon codes.
22. On q-ary antipodal matchings and applications.
23. Bounds and constructions for granular media coding.
24. Low complexity two-dimensional weight-constrained codes.
25. Asymptotic enumeration of binary matrices with bounded row and column weights.
26. Fixed-rate tiling encoders for 2-D constraints.
27. Concave programming upper bounds on the capacity of 2-D constraints.
28. Approximate enumerative coding for 2-D constraints through ratios of maprix Products.
29. On linear balancing sets.
30. Bounds on the rate of 2-D bit-stuffing encoders.
31. List decoding of burst errors.
32. Two-dimensional constrained coding based on tiling.
33. On the Hardness of Decoding the Gale-Berlekamp Code.
34. Capacity Lower Bounds and Approximate Enumerative Coding for 2-D Constraints.
35. Bounds on Single-Exclusion Numbers and Stopping Redundancy of MDS Codes.
36. On Row-by-Row Coding for 2-D Constraints.
37. On the second moment of the distance distribution of binary codes.
38. On nearly-MDS expander codes.
39. Cross-symbol codes.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.