Low complexity two-dimensional weight-constrained codes

IEEE Transactions on Information Theory

Volumn 58, Issue 6, 2012, Pages 3892-3899

  Ordentlich, Erik ^a   Roth, Ron M ^b  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Boolean lattice; resistive memory; two dimensional coding; weight constrained codes

Indexed keywords

BINARY ARRAYS; HAMMING WEIGHTS; LOW COMPLEXITY; LOW COMPLEXITY CODING; RESISTIVE MEMORIES; WEIGHT-CONSTRAINED CODES;

BOOLEAN ALGEBRA; COMPUTER APPLICATIONS; INFORMATION THEORY;

TWO DIMENSIONAL;

EID: 84861370991     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2012.2190380     Document Type: Conference Paper

References (16)

1. R. Talyansky, T. Etzion, and R. M. Roth, "Efficient code constructions for certain two-dimensional constraints," IEEE Trans. Inf. Theory, vol. 45, pp. 794-799, 1999.
2. E. Ordentlich and R. M. Roth, "Two-dimensional weight-constrained codes through enumeration bounds," IEEE Trans. Inf. Theory, vol. 46, pp. 1292-1301, 2000.
3. E. Ordentlich, F. Parvaresh, and R. M. Roth, "Asymptotic enumeration of binary matrices with bounded row and column weights," in Proc. IEEE Int. Symp. Inf. Theory, St. Petersburg, Russia, Jul. 2011, pp. 116-120.
4. D. B. Strukov and R. S. Williams, "Four-dimensional address topology for circuits with stacked multilayer crossbar arrays," Proc. Natl. Acad. Sci., vol. 106, pp. 20155-20158, 2009.
5. E. Ordentlich, G. M. Ribeiro, R. M. Roth, G. Seroussi, and P. O. Vontobel, "Coding for limiting current in memristor crossbar memories," in Proc. 2nd Ann. Non-Volatile Memories Workshop, UC San Diego, La Jolla, CA, Mar. 2011 [Online]. Available: nvmw. ucsd. edu/2011
6. R. J. Glauber, "Time-dependent statistics of the Ising model," J. Math. Phys., vol. 4, pp. 294-307, 1963.
7. N. L. Biggs, Discrete Mathematics. Oxford, U. K.: Oxford Univ. Press, 1985.
8. G. Hurlbert, "The antipodal layers problem," Discrete Math., vol. 128, pp. 237-245, 1994.
9. M. Aigner, "Lexicographic matching in Boolean algebras," J. Comb. Theory B, vol. 14, pp. 187-194, 1973.
10. D. A. Duffus, H. A. Kierstead, and H. S. Snevily, "An explicit 1-factorization in the middle of the Boolean lattice," J. Comb. Theory A, vol. 65, pp. 334-342, 1994.
11. H. A. Kierstead and W. T. Trotter, "Explicit matchings in the middle levels of the Boolean lattice," Order, vol. 5, pp. 163-171, 1988.
12. A. Dvoretzky and T. Motzkin, "A problem of arrangements," Duke Math. J., vol. 14, pp. 305-313, 1947.
13. N. Dershowitz and S. Zaks, "The Cycle Lemma and some applications," Eur. J. Combinator., vol. 11, pp. 35-40, 1990.
14. N. de Bruijn, C. Tengbergen, and D. Kruyswijk, "On the set of divisors of a number," Nieuw Arch. Wiskunde, vol. 23, pp. 191-193, 1951.
15. C. Greene andD. J. Kleitman, "Strong versions of Sperner's Theorem," J. Comb. Theory A, vol. 20, pp. 80-88, 1976.
16. D. Lemire, "Streaming maximum-minimum filter using no more than three comparisons per element," Nordic J. Comput., vol. 13, pp. 328-339, 2006.