Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes (bibtex)

by Anthony Leverrier

Reference:

Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes (Anthony Leverrier), In Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023 (Nikhil Bansal, Viswanath Nagarajan, eds.), SIAM, 2023.

Bibtex Entry:

@inproceedings{DBLP:conf/soda/LeverrierZ23,
	author = {Anthony Leverrier and Gilles Z{\'{e}}mor},
	bibsource = {dblp computer science bibliography, https://dblp.org},
	biburl = {https://dblp.org/rec/conf/soda/LeverrierZ23.bib},
	booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2023, Florence, Italy, January 22-25, 2023},
	date-added = {2024-09-05 11:02:54 +0200},
	date-modified = {2024-09-05 11:02:54 +0200},
	doi = {10.1137/1.9781611977554.CH45},
	editor = {Nikhil Bansal and Viswanath Nagarajan},
	pages = {1216--1244},
	publisher = {{SIAM}},
	timestamp = {Fri, 17 Feb 2023 09:28:57 +0100},
	title = {Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes},
	url = {https://doi.org/10.1137/1.9781611977554.ch45},
	year = {2023},
	bdsk-url-1 = {https://doi.org/10.1137/1.9781611977554.ch45}}