Constrained de Bruijn Codes and their Applications
暂无分享,去创建一个
Eitan Yaakobi | Yeow Meng Chee | Han Mao Kiah | Tuvi Etzion | Van Khu Vu | T. Etzion | Eitan Yaakobi | Y. Chee | H. M. Kiah
[1] Kenneth G. Paterson,et al. A method for constructing decodable de Bruijn sequences , 1996, IEEE Trans. Inf. Theory.
[2] Eitan Yaakobi,et al. Coding for racetrack memories , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[3] Mario Blaum,et al. Codes for Symbol-Pair Read Channels , 2010, IEEE Transactions on Information Theory.
[4] Thomas M. Cover,et al. Enumerative source encoding , 1973, IEEE Trans. Inf. Theory.
[5] A. Robert Calderbank,et al. Correcting Two Deletions and Insertions in Racetrack Memory , 2017, ArXiv.
[6] Tuvi Etzion,et al. Algorithms for the generation of full-length shift-register sequences , 1984, IEEE Trans. Inf. Theory.
[7] H. Fredricksen. A Survey of Full Length Nonlinear Shift Register Cycle Algorithms , 1982 .
[8] Venkatesan Guruswami,et al. Efficient Low-Redundancy Codes for Correcting Multiple Deletions , 2015, IEEE Transactions on Information Theory.
[9] de Ng Dick Bruijn. A combinatorial problem , 1946 .
[10] Lara Dolecek,et al. Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods , 2009, SIAM J. Discret. Math..
[11] Wenqing Wu,et al. Cross-layer racetrack memory design for ultra high density and low power consumption , 2013, 2013 50th ACM/EDAC/IEEE Design Automation Conference (DAC).
[12] Paul H. Siegel,et al. Constructions and Decoding of Cyclic Codes Over $b$ -Symbol Read Channels , 2016, IEEE Transactions on Information Theory.
[13] Abraham Lempel,et al. On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers , 1970, IEEE Transactions on Computers.
[14] S. Parkin,et al. Magnetic Domain-Wall Racetrack Memory , 2008, Science.
[15] Eitan Yaakobi,et al. Codes Correcting Limited-Shift Errors in Racetrack Memories , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).
[16] Yu Wang,et al. Hi-fi playback: Tolerating position errors in shift operations of racetrack memory , 2015, 2015 ACM/IEEE 42nd Annual International Symposium on Computer Architecture (ISCA).
[17] Adriaan J. de Lind van Wijngaarden,et al. Construction of Maximum Run-Length Limited Codes Using Sequence Replacement Techniques , 2010, IEEE Journal on Selected Areas in Communications.