- On Linear Balancing Sets Arya Mazumdar
- Single-Exclusion Number and the Stopping Redundancy of MDS Codes
- Bounds for Binary Codes with Narrow Distance Distributions
- E cient Decoding of Reed-Solomon Codes Beyond Half the Minimum Distance
- Bounds on the List-Decoding Radius of Reed-Solomon Codes
- On Runlength-Limited Coding with DC Ron M. Roth
- E cient Code Constructions for Certain Two-Dimensional Constraints
- Improved Bit-Stu ng Bounds on Two-Dimensional Constraints
- Independent Sets in Regular Hypergraphs and Multi-Dimensional Runlength-Limited Constraints
- Hierarchical Guessing with a Fidelity Criterion Neri Merhav Ron M. Rothy
- Symbol-Intersecting Codes Ron M. Roth and Gadiel Seroussi
- FiniteState Encoders As described in Section 1.4, an encoder takes the form of a finitestatemachine (see Fig
- Resistor-Logic Demultiplexers for Nanoelectronics
- Convex Programming Upper Bounds on the Capacity of 2-D Constraints
- Changes Inserted in Second Printing (2007) p. 47, Notes, line 9 (and bottom of p. 528) [26 Jan 07, thanks to K.T. Phelps]
- Parallel Constrained Coding with Application to Two-Dimensional Constraints
- Constrained Systems 2.1 Labeled graphs and constraints
- On Lowest-Density MDS Codes Mario Blaum
- Defect-Tolerant Demultiplexer Circuits Based on Threshold Logic and Coding
- Two-Dimensional Constrained Coding Based on Artyom Sharov Ron M. Roth
- Lower Bounds on the Anticipation of Encoders for Input-Constrained Channels
- Two-Dimensional Weight-Constrained Codes through Enumeration Bounds
- Other Code Construction Methods In Chapter 5, we focused on the statesplitting algorithm which gives a rigorous proof of the
- List Decoding of Burst Errors Ron M. Roth, Fellow, IEEE, and Pascal O. Vontobel, Member, IEEE
- E cient Encoding Algorithm for Third-Order Spectral-Null Codes
- Improved Nearly-MDS Expander Codes Ron M. Roth and Vitaly Skachek
- In most data recording systems and many data communication systems, some sequences are more prone to error than others. Thus, in order to reduce the likelihood of error, it
- Nested Block Decodable Runlength Limited Josh Hogan Ron M. Roth
- Nested Input-Constrained Codes Josh Hogan Ron M. Roth
- Reduced-Redundancy Product Codes for Burst Error Correction
- E cient Coding Schemes for the Hard-Square Ron M. Roth
- Preface vii 1 Channels and Constraints 1
- Lossless Sliding-Block Compression of Constrained Systems
- Complexity of Encoders 7.1 Complexity criteria
- Channels and Constraints The purpose of this chapter is to motivate, via several engineering examples, the subject of
- The StateSplitting Algorithm In this chapter, we provide an exposition of the statesplitting algorithm, which implements
- ErrorCorrecting Constrained Coding In this chapter, we consider codes that have combined errorcorrection and constrained
- Error Correction and Concatenation The preceding chapters have addressed properties of constrained systems and construction
- Bounds on the Rate of 2-D Bit-Stuffing Encoders Ido Tal Ron M. Roth
- On Row-by-Row Coding for 2-D Constraints Ido Tal Tuvi Etzion Ron M. Roth
- On the Hardness of Decoding the GaleBerlekamp Ron M. Roth Krishnamurthy Viswanathan
- In this chapter we introduce and study the notion of capacity, which is one of the most im portant parameters related to constrained systems. In the context of coding, the significance
- Bibliography [AW91] K.A.S. AbdelGhaffar, J.H. Weber, Bounds and constructions for run
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to
- Lowest-Density MDS Codes over Extension Erez Louidor and Ron M. Roth
- Designs, Codes and Cryptography manuscript No. (will be inserted by the editor)
- Two-Dimensional Maximum-Likelihood Sequence Detection is NP Hard