113 lines
3.6 KiB
BibTeX
113 lines
3.6 KiB
BibTeX
@phdthesis{feldman_thesis,
|
||
author = {Feldman, Jon},
|
||
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}
|
||
}
|
||
|
||
@online{mackay_enc,
|
||
author = {MacKay, David J.C.},
|
||
title = {Encyclopedia of Sparse Graph Codes},
|
||
date = {2023-01},
|
||
url = {http://www.inference.org.uk/mackay/codes/data.html}
|
||
}
|
||
|
||
@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},
|
||
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 = {2023},
|
||
type = {Bachelor's Thesis},
|
||
institution = {KIT},
|
||
}
|
||
|
||
@book{distr_opt_book,
|
||
author = {Boyd, Stephen and Parikh, Neal and Chu, Eric and Peleato, Borja and Eckstein, Jonathan},
|
||
title = {Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers},
|
||
year = {2011},
|
||
volume = {},
|
||
number = {},
|
||
pages = {},
|
||
doi = {},
|
||
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}
|
||
}
|
||
|