DESIGNS CODES AND CRYPTOGRAPHY 85(3) 483-521 2017年12月 [査読有り]
Invented in the 1960s, permutation codes have reemerged in recent years as a topic of great interest because of properties making them attractive for certain modern technological applications, especially flash memory. In 2011 a polynomial time alg...
IEEE International Symposium on Information Theory - Proceedings 1628-1632 2017年8月 [査読有り]
Permutation codes, in the form of rank modulation, have shown promise for applications such as flash memory. One of the metrics recently suggested as appropriate for rank modulation is the Ulam metric. Multipermutation codes have also been propose...
量子誤り訂正は,量子状態を確実に保存し高信頼度で通信すること,つまり量子計算および量子通信を実現するために必要な技術である.量子LDPC符号は,味なパリティ検査方程式によって定義された,古典LDPC符号に対応する量子誤り訂正符号である.CSS(Calderbank, Shor and Steane)符号は,量子誤り訂正符号の重要な符号クラスである.本研究では,有限体上で定義されたLDPC符号を用いたCSS符号を提案している.この提案符号は,限界距離復号法の性能限界を超えた復号性能を有し,従...
Manabu Hagiwara   Marc P. C. Fossorier   Hideki Imai   
IEEE International Symposium on Information Theory - Proceedings 784-788 2010年
In this paper, we introduce the concept of correctable error set for the BSC, which allows to generalize sum-product decoding for this channel. As a result, better error performance or faster convergence can be achieved. Furthermore, the correctab...