volume 50 issue 5 pages 824-838

Improved Bit-Stuffing Bounds on Two-Dimensional Constraints

Publication typeJournal Article
Publication date2004-05-06
scimago Q1
wos Q1
SJR1.464
CiteScore5.5
Impact factor2.9
ISSN00189448, 15579654
Computer Science Applications
Library and Information Sciences
Information Systems
Abstract
We derive lower bounds on the capacity of certain two-dimensional (2-D) constraints by considering bounds on the entropy of measures induced by bit-stuffing encoders. A more detailed analysis of a previously proposed bit-stuffing encoder for (d,/spl infin/)-runlength-limited (RLL) constraints on the square lattice yields improved lower bounds on the capacity for all d /spl ges/ 2. This encoding approach is extended to (d,/spl infin/)-RLL constraints on the hexagonal lattice, and a similar analysis yields lower bounds on the capacity for d /spl ges/ 2. For the hexagonal (1,/spl infin/)-RLL constraint, the exact coding ratio of the bit-stuffing encoder is calculated and is shown to be within 0.5% of the (known) capacity. Finally, a lower bound is presented on the coding ratio of a bit-stuffing encoder for the constraint on the square lattice where each bit is equal to at least one of its four closest neighbors, thereby providing a lower bound on the capacity of this constraint.
Found 
Found 

Top-30

Journals

2
4
6
8
10
12
IEEE Transactions on Information Theory
11 publications, 24.44%
IEEE Transactions on Communications
3 publications, 6.67%
IEEE Journal on Selected Areas in Communications
2 publications, 4.44%
Lecture Notes in Computer Science
2 publications, 4.44%
ACM Transactions on Modeling and Performance Evaluation of Computing Systems
1 publication, 2.22%
IET Communications
1 publication, 2.22%
Lecture Notes in Electrical Engineering
1 publication, 2.22%
IEEE Transactions on Computers
1 publication, 2.22%
Proceedings of the IEEE
1 publication, 2.22%
IEEE Transactions on Magnetics
1 publication, 2.22%
Lecture Notes in Networks and Systems
1 publication, 2.22%
IEEE BITS the Information Theory Magazine
1 publication, 2.22%
2
4
6
8
10
12

Publishers

5
10
15
20
25
30
35
40
Institute of Electrical and Electronics Engineers (IEEE)
38 publications, 84.44%
Springer Nature
4 publications, 8.89%
Association for Computing Machinery (ACM)
1 publication, 2.22%
Institution of Engineering and Technology (IET)
1 publication, 2.22%
5
10
15
20
25
30
35
40
  • We do not take into account publications without a DOI.
  • Statistics recalculated weekly.

Are you a researcher?

Create a profile to get free access to personal recommendations for colleagues and new articles.
Metrics
45
Share
Cite this
GOST |
Cite this
GOST Copy
HALEVY S. et al. Improved Bit-Stuffing Bounds on Two-Dimensional Constraints // IEEE Transactions on Information Theory. 2004. Vol. 50. No. 5. pp. 824-838.
GOST all authors (up to 50) Copy
HALEVY S., Chen J., Roth R. M., Siegel P. H., WOLF J. K. Improved Bit-Stuffing Bounds on Two-Dimensional Constraints // IEEE Transactions on Information Theory. 2004. Vol. 50. No. 5. pp. 824-838.
RIS |
Cite this
RIS Copy
TY - JOUR
DO - 10.1109/tit.2004.826633
UR - https://doi.org/10.1109/tit.2004.826633
TI - Improved Bit-Stuffing Bounds on Two-Dimensional Constraints
T2 - IEEE Transactions on Information Theory
AU - HALEVY, S.
AU - Chen, J
AU - Roth, R. M.
AU - Siegel, P. H.
AU - WOLF, J. K.
PY - 2004
DA - 2004/05/06
PB - Institute of Electrical and Electronics Engineers (IEEE)
SP - 824-838
IS - 5
VL - 50
SN - 0018-9448
SN - 1557-9654
ER -
BibTex |
Cite this
BibTex (up to 50 authors) Copy
@article{2004_HALEVY,
author = {S. HALEVY and J Chen and R. M. Roth and P. H. Siegel and J. K. WOLF},
title = {Improved Bit-Stuffing Bounds on Two-Dimensional Constraints},
journal = {IEEE Transactions on Information Theory},
year = {2004},
volume = {50},
publisher = {Institute of Electrical and Electronics Engineers (IEEE)},
month = {may},
url = {https://doi.org/10.1109/tit.2004.826633},
number = {5},
pages = {824--838},
doi = {10.1109/tit.2004.826633}
}
MLA
Cite this
MLA Copy
HALEVY, S., et al. “Improved Bit-Stuffing Bounds on Two-Dimensional Constraints.” IEEE Transactions on Information Theory, vol. 50, no. 5, May. 2004, pp. 824-838. https://doi.org/10.1109/tit.2004.826633.