@phdthesis{feldman_thesis,
    author      = {Feldman, J.},
    title       = {Decoding error-correcting codes via linear programming},
    type        = {phdthesis},
    institution = {MIT},
    year        = {2003},
    url         = {https://dspace.mit.edu/handle/1721.1/42831},
}

@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},
    number={ },
    pages={2022TAP0002},
    year={2022},
    doi={10.1587/transfun.2022TAP0002}
}

@article{ml_np_hard_proof,
    title   = {On the inherent intractability of certain coding problems (Corresp.)},
    volume  = {24},
    DOI     = {10.1109/tit.1978.1055873},
    number  = {3},
    journal = {IEEE Transactions on Information Theory},
    author  = {Berlekamp, E. and McEliece, R. and van Tilborg, H.},
    year    = {1978},
    month   = {5},
    pages   = {384–386},
%    url     = {https://authors.library.caltech.edu/5607/1/BERieeetit78.pdf}
}

@article{ldpc_conv,
    author    = {Banu Kabakulak and Z. Caner Taşkın and Ali Emre Pusane},
    title     = {Optimization–based decoding algorithms for LDPC convolutional codes in communication systems},
    journal   = {IISE Transactions},
    volume    = {51},
    number    = {10},
    pages     = {1061-1074},
    year      = {2019},
    publisher = {Taylor \& Francis},
    doi       = {10.1080/24725854.2018.1550692},
    URL       = {https://doi.org/10.1080/24725854.2018.1550692},
%    eprint    = {https://doi.org/10.1080/24725854.2018.1550692}
}

@article{proximal_algorithms,
    author = {Parikh, Neal and Boyd, Stephen},
    title = {Proximal Algorithms},
    year = {2014},
    issue_date = {January 2014},
    publisher = {Now Publishers Inc.},
    address = {Hanover, MA, USA},
    volume = {1},
    number = {3},
    issn = {2167-3888},
%    url = {https://doi.org/10.1561/2400000003},
    url={https://ieeexplore.ieee.org/document/8187362},
%    doi = {10.1561/2400000003},
    journal = {Found. Trends Optim.},
    month = {1},
    pages = {127–239},
    numpages = {113}
}
      
@mastersthesis{yanxia_lu_thesis,
    author      = {Lu, Yanxia},
    title       = {Realization of Channel Decoding Using Optimization Techniques},
    year        = {2022},
    type        = {Bachelor's Thesis},
    institution = {KIT},
}

@article{distr_opt_book,
  title={Distributed optimization and statistical learning via the alternating direction method of multipliers},
  author={Boyd, Stephen and Parikh, Neal and Chu, Eric and Peleato, Borja and Eckstein, Jonathan and others},
  journal={Foundations and Trends in Machine learning},
  volume={3},
  number={1},
  pages={1--122},
  year={2011},
  publisher={Now Publishers, Inc.},
  url= {https://ieeexplore.ieee.org/document/8186925}
}

@INPROCEEDINGS{efficient_lp_dec_admm,
  author    = {Zhang, Xiaojie and Siegel, Paul H.},
  booktitle = {2013 IEEE International Symposium on Information Theory}, 
  title     = {Efficient iterative LP decoding of LDPC codes with alternating direction method of multipliers}, 
  year      = {2013},
  volume    = {},
  number    = {},
  pages     = {1501-1505},
  doi       = {10.1109/ISIT.2013.6620477}
}

@ARTICLE{feldman_paper,
  author={Feldman, J. and Wainwright, M.J. and Karger, D.R.},
  journal={IEEE Transactions on Information 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{lautern,
  author={Gensheimer, Florian and Dietz, Tobias and Kraft, Kira and Ruzika, Stefan and Wehn, Norbert},
  journal={IEEE Transactions on Information Theory}, 
  title={A Reduced-Complexity Projection Algorithm for ADMM-Based LP Decoding}, 
  year={2020},
  volume={66},
  number={8},
  pages={4819-4833},
  doi={10.1109/TIT.2020.2984247}
}

@ARTICLE{original_admm,
  author={Barman, Siddharth and Liu, Xishuo and Draper, Stark C. and Recht, Benjamin},
  journal={IEEE Transactions on Information Theory}, 
  title={Decomposition Methods for Large Scale LP Decoding}, 
  year={2013},
  volume={59},
  number={12},
  pages={7870-7886},
  doi={10.1109/TIT.2013.2281372}
}

@book{intro_to_lin_opt_book,
  title={Introduction to linear optimization},
  author={Bertsimas, Dimitris and Tsitsiklis, John N},
  volume={6},
  year={1997},
  publisher={Athena scientific Belmont, MA},
  isbn={978-1-886529-19-9}
}

@INPROCEEDINGS{alp,
  author={Taghavi, Mohammad H. and Siegel, Paul H.},
  booktitle={2006 IEEE International Symposium on Information Theory}, 
  title={Adaptive Linear Programming Decoding}, 
  year={2006},
  volume={},
  number={},
  pages={1374-1378},
  doi={10.1109/ISIT.2006.262071}
}

@INPROCEEDINGS{interior_point,
  author={Vontobel, Pascal O.},
  booktitle={2008 Information Theory and Applications Workshop}, 
  title={Interior-point algorithms for linear-programming decoding}, 
  year={2008},
  volume={},
  number={},
  pages={433-437},
  doi={10.1109/ITA.2008.4601085}
}

@ARTICLE{pdd,
  author={Zhao, Ming-Min and Shi, Qingjiang and Cai, Yunlong and Zhao, Min-Jian and Yu, Quan},
  journal={IEEE Communications Letters}, 
  title={Decoding Binary Linear Codes Using Penalty Dual Decomposition Method}, 
  year={2019},
  volume={23},
  number={6},
  pages={958-962},
  doi={10.1109/LCOMM.2019.2911277}
}

@ARTICLE{mackay_rediscovery,
  author={MacKay, D.J.C.},
  journal={IEEE Transactions on Information 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}
}

@ARTICLE{principles_of_dig_comm,
  author={Forney, G.},
  year={2003},
  month={01},
  pages={},
  title={6.451 Principles of Digital Communication II, Spring 2003}
}

@book{ryan_lin_2009,
    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}
}

@ARTICLE{gallager_ldpc,
  author={Gallager, R.},
  journal={IRE Transactions on Information Theory}, 
  title={Low-density parity-check codes}, 
  year={1962},
  volume={8},
  number={1},
  pages={21-28},
  doi={10.1109/TIT.1962.1057683}
}

@online{lautern_channelcodes,
	author = "Helmling, Michael and Scholl, Stefan and Gensheimer, Florian and Dietz, Tobias and Kraft, Kira and Ruzika, Stefan and Wehn, Norbert",
	title = "{D}atabase of {C}hannel {C}odes and {ML} {S}imulation {R}esults",
    url={https://www.uni-kl.de/channel-codes},
	date = {2023-04}
}

@online{mackay_enc,
    author = {MacKay, David J.C.},
    title  = {Encyclopedia of Sparse Graph Codes},
    date   = {2023-04},
    url    = {http://www.inference.org.uk/mackay/codes/data.html}
}