The capacity and coding gain of certain checkerboard codes

We investigate the capacity of two-dimensional constrained codes using a recursive construction and numerical convergence-speeding techniques. Using our best value of the capacity, we define and compute a measure of coding gain which allows us to compare checkerboard codes to simple coding schemes.

Saved in:
Bibliographic Details
Main Authors: Weeks, W., Blahut, R.E.
Format: Conference Proceeding
Language:English
Subjects:
Applied sciences
Binary codes
Block codes
Convergence of numerical methods
Entropy
Exact sciences and technology
Extrapolation
Gain measurement
Information theory
Information, signal and communications theory
Interference constraints
Page description languages
Recursive estimation
Strips
Telecommunications and information theory
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We investigate the capacity of two-dimensional constrained codes using a recursive construction and numerical convergence-speeding techniques. Using our best value of the capacity, we define and compute a measure of coding gain which allows us to compare checkerboard codes to simple coding schemes.
DOI:10.1109/ISIT.1998.708927