Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Cohen, M.B.
and
Colbourn, C.J.
2000.
Steiner triple systems as multiple erasure correcting codes in large disk arrays.
p.
288.
Chee, Yeow Meng
Colbourn, Charles J.
and
Ling, Alan C.H.
2000.
Asymptotically optimal erasure-resilient codes for large disk arrays.
Discrete Applied Mathematics,
Vol. 102,
Issue. 1-2,
p.
3.
Colbourn, Charles J
Dinitz, Jeffrey H
and
Stinson, Douglas R
2001.
Quorum Systems Constructed from Combinatorial Designs.
Information and Computation,
Vol. 169,
Issue. 2,
p.
160.
Johnson, S.J.
and
Weller, S.R.
2001.
Construction of low-density parity-check codes from Kirkman triple systems.
Vol. 2,
Issue. ,
p.
970.
Cohen, Myra B.
and
Colbourn, Charles J.
2003.
Optimal and pessimal orderings of Steiner triple systems in disk arrays.
Theoretical Computer Science,
Vol. 297,
Issue. 1-3,
p.
103.
Kurtas, Erozan M.
Kuznetsov, Alexander V.
and
Vasic, Bane
2003.
Wiley Encyclopedia of Telecommunications.
Moura, J.M.F.
Jin Lu
and
Haotian Zhang
2004.
Structured low-density parity-check codes.
IEEE Signal Processing Magazine,
Vol. 21,
Issue. 1,
p.
42.
Vasic, B.
and
Milenkovic, O.
2004.
Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding.
IEEE Transactions on Information Theory,
Vol. 50,
Issue. 6,
p.
1156.
Fujiwara, Yuichiro
2005.
Constructions for anti‐mitre Steiner triple systems.
Journal of Combinatorial Designs,
Vol. 13,
Issue. 4,
p.
286.
Fujiwara, Yuichiro
2006.
Infinite classes of anti‐mitre and 5‐sparse Steiner triple systems.
Journal of Combinatorial Designs,
Vol. 14,
Issue. 3,
p.
237.
Forbes, A.D.
Grannell, M.J.
and
Griggs, T.S.
2007.
On 6-sparse Steiner triple systems.
Journal of Combinatorial Theory, Series A,
Vol. 114,
Issue. 2,
p.
235.
Fujiwara, Yuichiro
2007.
Nonexistence of sparse triple systems over abelian groups and involutions.
Journal of Algebraic Combinatorics,
Vol. 26,
Issue. 4,
p.
495.
Colbourn, Charles J.
and
Fujiwara, Yuichiro
2009.
Small stopping sets in Steiner triple systems.
Cryptography and Communications,
Vol. 1,
Issue. 1,
p.
31.
Colbourn, Charles
2009.
The configuration polytope of ℓ-line configurations in Steiner triple systems.
Mathematica Slovaca,
Vol. 59,
Issue. 1,
p.
77.
Fujiwara, Yuichiro
and
Colbourn, Charles J.
2010.
A Combinatorial Approach to X-Tolerant Compaction Circuits.
IEEE Transactions on Information Theory,
Vol. 56,
Issue. 7,
p.
3196.
Füredi, Zoltán
and
Ruszinkó, Miklós
2013.
Uniform hypergraphs containing no grids.
Advances in Mathematics,
Vol. 240,
Issue. ,
p.
302.
2015.
Latin Squares and their Applications.
p.
361.
Petelczyc, Krzysztof
Prażmowska, Małgorzata
and
Prażmowski, Krzysztof
2015.
A complete classification of the (154203)-configurations with at least three K5-graphs.
Discrete Mathematics,
Vol. 338,
Issue. 7,
p.
1243.
Prażmowska, Małgorzata
and
Prażmowski, Krzysztof
2016.
Binomial partial Steiner triple systems containing complete graphs.
Graphs and Combinatorics,
Vol. 32,
Issue. 5,
p.
2079.
Donovan, Diane
and
McCourt, Thomas A.
2018.
Combinatorial Algorithms.
Vol. 10765,
Issue. ,
p.
13.