Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Ekert, A.
Jozsa, R.
Penrose, R.
and
Steane, A. M.
1998.
Introduction to quantum error correction.
Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences,
Vol. 356,
Issue. 1743,
p.
1739.
Davis, James A.
and
Jedwab, Jonathan
1999.
Difference Sets, Sequences and their Correlation Properties.
p.
85.
Jungnickel, Dieter
and
Pott, Alexander
1999.
Difference Sets, Sequences and their Correlation Properties.
p.
259.
Golemac, Anka
and
Vučičić, Tanja
2001.
New difference sets in nonabelian groups of order 100.
Journal of Combinatorial Designs,
Vol. 9,
Issue. 6,
p.
424.
Lam, Clement
Lam, Sigmund
and
Tonchev, Vladimir D.
2001.
Bounds on the number of Hadamard designs of even order.
Journal of Combinatorial Designs,
Vol. 9,
Issue. 5,
p.
363.
Ling, Alan C. H.
2001.
More on the existence of small quasimultiples of affine and projective planes of arbitrary order.
Journal of Combinatorial Designs,
Vol. 9,
Issue. 3,
p.
182.
Schmidt, Bernhard
2001.
European Congress of Mathematics.
p.
533.
Arasu, K.T.
and
Ma, S.L.
2001.
A nonexistence result on difference sets, partial difference sets and divisible difference sets.
Journal of Statistical Planning and Inference,
Vol. 95,
Issue. 1-2,
p.
67.
Buratti, Marco
2001.
1‐Rotational Steiner triple systems over arbitrary groups.
Journal of Combinatorial Designs,
Vol. 9,
Issue. 3,
p.
215.
Charnes, Chris
Rötteler, Martin
and
Beth, Thomas
2001.
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes.
Vol. 2227,
Issue. ,
p.
249.
Ge, G.
and
Yin, J.
2001.
Constructions for optimal (υ, 4, 1) optical orthogonal codes.
IEEE Transactions on Information Theory,
Vol. 47,
Issue. 7,
p.
2998.
Ionin, Yury J.
and
Mackenzie‐Fleming, Kirsten
2002.
A technique for constructing non‐embeddable quasi‐residual designs.
Journal of Combinatorial Designs,
Vol. 10,
Issue. 3,
p.
160.
Sane, Sharad
2002.
Number Theory and Discrete Mathematics.
p.
81.
Schulz, Ralph-Hardo
2003.
Codierungstheorie.
p.
178.
Fang, Kai-Tai
Ge, Gen-Nian
Liu, Min-Qian
and
Qin, Hong
2003.
Construction of minimum generalized aberration designs.
Metrika,
Vol. 57,
Issue. 1,
p.
37.
Beidar, K.I.
Ke, W.-F.
Liu, C.-H.
and
Wu, W.-R.
2003.
Automorphism groups of certain simple 2-(q,3,λ) designs constructed from finite fields.
Finite Fields and Their Applications,
Vol. 9,
Issue. 4,
p.
400.
Vasco, María Isabel González
Rötteler, Martin
and
Steinwandt, Rainer
2003.
On Minimal Length Factorizations of Finite Groups.
Experimental Mathematics,
Vol. 12,
Issue. 1,
p.
1.
Moura, Lucia
Stardom, John
Stevens, Brett
and
Williams, Alan
2003.
Covering arrays with mixed alphabet sizes.
Journal of Combinatorial Designs,
Vol. 11,
Issue. 6,
p.
413.
Jamison, Robert E.
Jiang, Tao
and
Ling, Alan C. H.
2003.
Constrained Ramsey numbers of graphs.
Journal of Graph Theory,
Vol. 42,
Issue. 1,
p.
1.
Ionin, Yury J.
and
Kharaghani, Hadi
2003.
New families of strongly regular graphs.
Journal of Combinatorial Designs,
Vol. 11,
Issue. 3,
p.
208.