116 lines
3.1 KiB
BibTeX
116 lines
3.1 KiB
BibTeX
@ARTICLE{ADMM,
|
||
author={Barman, Siddharth and Liu, Xishuo and Draper, Stark C. and Recht, Benjamin},
|
||
journal={Trans. Inf. Theory},
|
||
title={Decomposition Methods for Large Scale LP Decoding},
|
||
year={2013},
|
||
volume={59},
|
||
number={12},
|
||
pages={7870-7886},
|
||
% doi={10.1109/TIT.2013.2281372}
|
||
}
|
||
|
||
@ARTICLE{feldman_paper,
|
||
author={Feldman, J. and Wainwright, M.J. and Karger, D.R.},
|
||
journal={IEEE Trans. Inf. Theory},
|
||
title={Using linear programming to Decode Binary linear codes},
|
||
year={2005},
|
||
volume={51},
|
||
number={3},
|
||
pages={954-972},
|
||
% doi={10.1109/TIT.2004.842696}
|
||
}
|
||
|
||
@ARTICLE{ml_in_the_list,
|
||
author={Geiselhart, Marvin and Elkelesh, Ahmed and Ebada, Moustafa and Cammerer, Sebastian and Brink, Stephan ten},
|
||
journal={IEEE Trans. Commun.},
|
||
title={Automorphism Ensemble Decoding of Reed–Muller Codes},
|
||
year={2021},
|
||
volume={69},
|
||
number={10},
|
||
pages={6424-6438},
|
||
% doi={10.1109/TCOMM.2021.3098798}
|
||
}
|
||
|
||
@ARTICLE{mackay99,
|
||
author={MacKay, D.J.C.},
|
||
journal={IEEE Trans. Inf. Theory},
|
||
title={Good error-correcting codes based on very sparse matrices},
|
||
year={1999},
|
||
volume={45},
|
||
number={2},
|
||
pages={399-431},
|
||
% doi={10.1109/18.748992}
|
||
}
|
||
|
||
@online{mackay,
|
||
author = {MacKay, David J.C.},
|
||
title = {Encyclopedia of Sparse Graph Codes},
|
||
date = {2023-04},
|
||
url = {www.inference.org.uk/mackay/codes/data.html}
|
||
}
|
||
|
||
@book{proximal_algorithms,
|
||
title={Proximal algorithms},
|
||
author={Parikh, Neal and Boyd, Stephen and others},
|
||
journal={Foundations and trends{\textregistered} in Optimization},
|
||
volume={1},
|
||
number={3},
|
||
pages={127--239},
|
||
year={2014},
|
||
publisher={Now Publishers, Inc.}
|
||
}
|
||
|
||
@book{channel_codes_book,
|
||
place={Cambridge},
|
||
title={Channel Codes: Classical and Modern},
|
||
% DOI={10.1017/CBO9780511803253},
|
||
publisher={Cambridge University Press},
|
||
author={Ryan, William and Lin, Shu},
|
||
year={2009},
|
||
% url={https://d1.amobbs.com/bbs_upload782111/files_35/ourdev_604508GHLFR2.pdf}
|
||
}
|
||
|
||
@INPROCEEDINGS{adaptive_lp_decoding,
|
||
author={Taghavi, Mohammad H. and Siegel, Paul H.},
|
||
booktitle={IEEE Proc. ISIT},
|
||
title={Adaptive Linear Programming Decoding},
|
||
year={2006},
|
||
volume={},
|
||
number={},
|
||
pages={1374-1378},
|
||
% doi={10.1109/ISIT.2006.262071}
|
||
}
|
||
|
||
@INPROCEEDINGS{interior_point_decoding,
|
||
author={Vontobel, Pascal O.},
|
||
booktitle={Proc. ITA},
|
||
title={Interior-point algorithms for linear-programming decoding},
|
||
year={2008},
|
||
volume={},
|
||
number={},
|
||
pages={433-437},
|
||
% doi={10.1109/ITA.2008.4601085}
|
||
}
|
||
|
||
@article{proximal_paper,
|
||
title={Proximal Decoding for {LDPC} Codes},
|
||
author={Tadashi Wadayama and Satoshi Takabe},
|
||
journal={IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences},
|
||
% volume={advpub},
|
||
% pages={2022TAP0002},
|
||
year={2022},
|
||
% doi={10.1587/transfun.2022TAP0002}
|
||
}
|
||
|
||
@ARTICLE{chase_decoding,
|
||
author={Chase, D.},
|
||
journal={IEEE Trans. Inf. Theory},
|
||
title={Class of algorithms for decoding block codes with channel measurement information},
|
||
year={1972},
|
||
% volume={18},
|
||
% number={1},
|
||
% pages={170-182},
|
||
% keywords={},
|
||
% doi={10.1109/TIT.1972.1054746}}
|
||
}
|