@article{oai:senshu-u.repo.nii.ac.jp:00007899,
 author = {高橋, 良介 and 高野, 祐一},
 journal = {情報科学研究},
 month = {Mar},
 note = {This paper is concerned with bit-flipping algorithms for decoding low-density parity check codes. The gradient-descent bit flipping (GDBF) is known as a high-performance class of bitflipping algorithms; however, once GDBF becomes trapped at local optimal solutions, it cannot escape from them. Several algorithms, including noisy gradient-descent bit flipping (NGDBF), have been devised to overcome this drawback. For the same purpose, we develop a bit-flipping algorithm based on the tabu search, which is one of the most effective metaheuristics. The simulation results demonstrate that our algorithm achieved higher bit error rate performance than GDBF did. Moreover, our algorithm required a smaller number of iterations to find a good-quality solution than NGDBF did.},
 pages = {51--59},
 title = {LDPC符号に対するタブー探索法に基づく勾配降下ビット反転復号法},
 volume = {39},
 year = {2019}
}