On the redundancy of two-dimensional balanced codes
E. Ordentlich; R.M. Roth;
On the redundancy of two-dimensional balanced codes
Let A/sub n/spl times/m/ be the set of binary n/spl times/m arrays in which each row, and respectively each column, has the same number of 0's and 1's. We prove the lower bound log/sub 2/|A/sub n/spl times/m/|/spl ges/nm- 1/2 (nlog/sub 2/(2m)+mlog/sub 2/(2n)). We also show that this bound is tight up to an additive term O(n+m).
- Technion – Israel Institute of Technology Israel
- Hewlett-Packard (United States) United States
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
selected citations
Citations provided by BIP!
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 1
Average
Average
Average
Fields of Science (4) View all