DocumentCode
2053603
Title
Capacity bounds for the hard-triangle model
Author
Nagy, Zsigmond ; Zeger, Kenneth
Author_Institution
Dept. of Electr. & Comput. Eng., California Univ., San Diego, La Jolla, CA, USA
fYear
2004
fDate
27 June-2 July 2004
Firstpage
162
Abstract
This paper describes the capacity bounds for the hard triangle model and examines such constraints for an equilateral triangular nonlattice tiling of the two-dimensional plane. The capacity is analyzed by deriving an upper bound analytically and obtain a lower bound by exhibiting a bit stuffing algorithm for hard-triangle constrained encoder. The encoder maps a random sequence of independent bits with the probability to calculate the coding rate of the encoder.
Keywords
algorithm theory; constraint theory; encoding; probability; random sequences; bit stuffing algorithm; capacity bound; equilateral triangular nonlattice tiling; hard-triangle constrained encoder; probability; random sequence; two-dimensional plane; Algorithm design and analysis; Binary sequences; Encoding; Labeling; Lattices; Nearest neighbor searches; Optical devices; Upper bound; Wireless communication;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN
0-7803-8280-3
Type
conf
DOI
10.1109/ISIT.2004.1365196
Filename
1365196
Link To Document