Proof for channel capacity of two-dimensional asymmetric constrained code
Peng Li · Jisuanji gongcheng yu sheji · 2012
To determine whether the channel capacity of two-dimensional asymmetric constrained code is positive or zero,scanning method is proposed.If each location in(d1,k1,d2,k2)-constrained matrix can be determined by known signs and is able to be scanned,then channel capacity is 0.Some specific constraints are used to verify scanning method is more validated than algebraic and combinatorial methods.The common technology for proofing channel capacity positive is used to find two distinct m×n matrices satisfying(d1,k1,d2,k2) constraints.If these two matrices satisfy(d1,k1,d2,k2)constraints under each transformation,then the channel capacity Cd1,k1,d2,k2≥1/mn.This method is used to expand positive capacity region.