Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Tillich, Jean-Pierre
and
Zémor, Gilles
1997.
Optimal Cycle Codes Constructed From Ramanujan Graphs.
SIAM Journal on Discrete Mathematics,
Vol. 10,
Issue. 3,
p.
447.
ZÉmor, Gilles
2001.
Codes, Systems, and Graphical Models.
Vol. 123,
Issue. ,
p.
311.
Richardson, T.J.
Shokrollahi, M.A.
and
Urbanke, R.L.
2001.
Design of capacity-approaching irregular low-density parity-check codes.
IEEE Transactions on Information Theory,
Vol. 47,
Issue. 2,
p.
619.
Aji, Srinivas
Jin, Hui
Khandekar, Aamod
MacKay, David J. C.
and
Mceliece, Robert J.
2001.
Codes, Systems, and Graphical Models.
Vol. 123,
Issue. ,
p.
195.
Barg, Alexander
and
Zémor, Gilles
2004.
Error Exponents of Expander Codes under Linear-Complexity Decoding.
SIAM Journal on Discrete Mathematics,
Vol. 17,
Issue. 3,
p.
426.
Zémor, Gilles
2009.
Coding and Cryptology.
Vol. 5557,
Issue. ,
p.
259.
Delfosse, Nicolas
and
Zemor, Gilles
2010.
Quantum erasure-correcting codes and percolation on regular tilings of the hyperbolic plane.
p.
1.
Geelen, Jim
Gerards, Bert
and
Whittle, Geoff
2015.
The Highly Connected Matroids in Minor-Closed Classes.
Annals of Combinatorics,
Vol. 19,
Issue. 1,
p.
107.
Nelson, Peter
and
van Zwam, Stefan H. M.
2016.
The Maximum-Likelihood Decoding Threshold for Cycle Codes of Graphs.
IEEE Transactions on Information Theory,
Vol. 62,
Issue. 10,
p.
5316.
Nelson, Peter
2017.
On the Probability that a Random Subgraph Contains a Circuit.
Journal of Graph Theory,
Vol. 85,
Issue. 3,
p.
644.
Qin, Hu
and
Guan, Puhua
2022.
A Fast Decoding Algorithm for Codes Raised by Subgraph of the Edge Space of Complete Graph.
SSRN Electronic Journal ,
Delfosse, Nicolas
Reichardt, Ben W.
and
Svore, Krysta M.
2022.
Beyond Single-Shot Fault-Tolerant Quantum Error Correction.
IEEE Transactions on Information Theory,
Vol. 68,
Issue. 1,
p.
287.