Capacity bounds for the hard-triangle model
Zsigmond Nagy, K. Zeger · 2004
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.