Low complexity two-dimensional weight-constrained codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 149-153

  Ordentlich, Erik ^a   Roth, Ron M ^b  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY ARRAYS; BOOLEAN LATTICE; HAMMING WEIGHTS; LOW COMPLEXITY; LOW COMPLEXITY CODING; MEMORY TECHNOLOGY;

INFORMATION THEORY;

EID: 80054824117     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6033792     Document Type: Conference Paper

References (14)

1. R. TALYANSKY, T. ETZION, R. M. ROTH, Efficient code constructions for certain two-dimensional constraints, IEEE Trans. Inform. Theory, 45(1999), 794-799.
2. E. ORDENTLICH, R. M. ROTH, Two-dimensional weight-constrained codes through enumeration bounds, IEEE Trans. Inform. Theory, 46(2000), 1292-1301.
3. E. ORDENTLICH, F. PARVARESH, R. M. ROTH, Asymptotic enumeration of binary matrices with bounded row and column weights, IEEE Intl. Symp. Inform. Theory, 2011.
4. D. B. STRUKOV, R. S. WILLIAMS, Four-dimensional address topology for circuits with stacked multilayer crossbar arrays, Proceedings of the National Academy of Sciences, Nov. 2009.
5. E. ORDENTLICH, G. M. RIBEIRO, R. M. ROTH, G. SEROUSSI, P. O. VONTOBEL, Codingfor limitingcurrent in memristorcrossbar memories, 2nd Annual Non-Volatile Memories Workshop, UCSD, La Jolla, CA, March 2011. Presentation slides are accessible at: http://nvmw.ucsd.edu/2011/.
6. R. J. GLAUBER, Time-dependent statistics of the Ising model, J. Mat. Phys., 4(1963), 294-307.
7. N. L. BIGGS, Discrete Mathematics, Oxford University Press, Oxford, 1985.
8. G. HURLBERT, The antipodal layers problem, Discrete Math., 128(1994), 237-245.
9. M. AIGNER, Lexicographic matching in Boolean algebras, J. Comb. Theory B, 14(1973), 187-194.
10. D. A. DUFFUS, H. A. KIERSTEAD, H. S. SNEVILY, An explicit 1-factorization in the middle of the Boolean lattice, J. Comb. Theory A, 65(1994), 334-342.
11. H. A. KIERSTEAD, W. T. TROTTER, Explicit matchings in the middle levels of the Boolean lattice, Order, 5(1988), 163-171.
12. N. DE BRUIJN, C. TENGBERGEN, D. KRUYSWIJK, On the set of divisors ofanumber, Nieuw Arch. Wiskunde, 23(1951), 191-193.
13. C. GREENE, D. J. KLEITMAN, Strong versions of Sperner's Theorem, J. Comb. Th. A, 20(1976), 80-88.
14. D. LEMIRE, Streaming maximum-minimumfilter using no more than three comparisons perelement, Nordic Journal of Computing, 13(2006), 328-339.