Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Flores, I.
and
Grey, L.
1960.
Optimization of Reference Signals for Character Recognition Systems.
IEEE Transactions on Electronic Computers,
Vol. EC-9,
Issue. 1,
p.
54.
Grey, L.
1962.
Some bounds for error-correcting codes.
IEEE Transactions on Information Theory,
Vol. 8,
Issue. 3,
p.
200.
Rankin, R. A.
1964.
On the minimal points of perfect quadratic forms.
Mathematische Zeitschrift,
Vol. 84,
Issue. 3,
p.
228.
1969.
Geometry of Numbers.
p.
471.
GOETHALS, J.M.
1973.
A Survey of Combinatorial Theory.
p.
189.
1977.
The Theory of Error-Correcting Codes.
Vol. 16,
Issue. ,
p.
703.
1987.
Geometry of Numbers.
Vol. 37,
Issue. ,
p.
632.
McGuire, Gary
1997.
Quasi-Symmetric Designs and Codes Meeting the Grey–Rankin Bound.
Journal of Combinatorial Theory, Series A,
Vol. 78,
Issue. 2,
p.
280.
Gulliver, T.A.
and
Harada, M.
1999.
Codes of lengths 120 and 136 meeting the Grey-Rankin bound and quasi-symmetric designs.
IEEE Transactions on Information Theory,
Vol. 45,
Issue. 2,
p.
703.
Berndt, Bruce C.
Kohnen, Winfried
and
Ono, Ken
2003.
Number Theory and Modular Forms.
Vol. 10,
Issue. ,
p.
9.
Dodunekova, R.
Dodunekov, S. M.
and
Nikolova, E.
2004.
On the error-detecting performance of some classes of block codes.
Problems of Information Transmission,
Vol. 40,
Issue. 4,
p.
356.
Dodunekova, R.
Dodunekov, S. M.
and
Nikolova, E.
2004.
On the error-detecting performance of some classes of block codes.
Problems of Information Transmission,
Vol. 40,
Issue. 4,
p.
356.
Bassalygo, L.
Dodunekov, S.
Helleseth, T.
and
Zinoviev, V.
2006.
On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound.
p.
278.
Fu, Fang-Wei
and
Xia, Shu-Tao
2007.
The characterization of binary constant weight codes meeting the bound of Fu and Shen.
Designs, Codes and Cryptography,
Vol. 43,
Issue. 1,
p.
9.
Bouyukliev, I.
Bouyuklieva, S.
and
Dodunekov, S.
2007.
On binary self-complementary [120, 9, 56] codes having an automorphism of order 3 and associated SDP designs.
Problems of Information Transmission,
Vol. 43,
Issue. 2,
p.
89.
Jasper, John
Mixon, Dustin G.
and
Fickus, Matthew
2014.
Kirkman Equiangular Tight Frames and Codes.
IEEE Transactions on Information Theory,
Vol. 60,
Issue. 1,
p.
170.
Zorlein, Henning
and
Bossert, Martin
2015.
Coherence Optimization and Best Complex Antipodal Spherical Codes.
IEEE Transactions on Signal Processing,
Vol. 63,
Issue. 24,
p.
6606.
Fickus, Matthew
Mixon, Dustin G.
and
Jasper, John
2016.
Equiangular Tight Frames From Hyperovals.
IEEE Transactions on Information Theory,
Vol. 62,
Issue. 9,
p.
5225.
Jasper, John
Mixon, Dustin G.
Iverson, Joseph W.
Lu, Yue M.
Papadakis, Manos
and
Van De Ville, Dimitri
2017.
Optimal projective packings from association schemes.
p.
22.
Fickus, Matthew
Jasper, John
Mixon, Dustin G.
and
Peterson, Jesse
2018.
Tremain equiangular tight frames.
Journal of Combinatorial Theory, Series A,
Vol. 153,
Issue. ,
p.
54.