New Lower Bounds for Binary Constant-Dimension Subspace Codes

References

• [Abe and Yoshiara 93] T. Abe and S. Yoshiara. “On Suzuki’s Construction of 2-Designs Over GF(q).” Sci. Rep. Hirosaki Univ. 40 (1993), 119–122.
   Google Scholar
• [Alltop 69] W. O. Alltop. “An Infinite Class of 4-Designs.” J. Combin. Theory 6 (1969), 320–322.
   Google Scholar
• [Artin 57] E. Artin. Geometric Algebra. New York: Interscience Publishers, 1957.
   Google Scholar
• [Bomze et al. 99] I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo. “The Maximum Clique Problem.” In Handbook of Combinatorial Optimization, Supplement Vol. A, edited by D. Z. Du and P. M. Pardalos, pp. 1–74. Dordrecht: Kluwer, 1999.
   Google Scholar
• [Braun 05] M. Braun. “Some New Designs Over Finite Fields.” Bayreuth. Math. Schr. 74 (2005), 58–68.
   Google Scholar
• [Braun et al. 16] M. Braun, T. Etzion, P. R. J. Östergård, A. Vardy, and A. Wassermann. “Existence of q-Analogs of Steiner Systems.” Forum of Mathematics. Pi 4 (2016), e7, 14pp.
   Google Scholar
• [Braun et al. 05] M. Braun, A. Kerber, and R. Laue. “Systematic Construction of q-Analogs of Designs.” Des. Codes Cryptogr. 34 (2005), 55–70.
   Web of Science ®Google Scholar
• [Braun et al. 14] M. Braun, A. Kohnert, P. R. J. Östergård, and A. Wassermann. “Large Sets of t-Designs Over Finite Fields.” J. Combin. Theory Ser. A 124 (2014), 195–202.
   Web of Science ®Google Scholar
• [Braun and Reichelt 14] M. Braun and J. Reichelt. “q-Analogs of Packing Designs.” J. Combin. Des. 22 (2014), 306–321.
   Google Scholar
• [El-Zanati et al. 10] S. El-Zanati, H. Jordon, G. Seelinger, P. Sissokho, and L. Spence. “The Maximum Size of a Partial 3-Spread in a Finite Vector Space Over GF(2).” Des. Codes Cryptogr. 54 (2010), 101–107.
   Web of Science ®Google Scholar
• [Etzion preprint] T. Etzion. “Problems on q-Analogs in Coding Theory.” Preprint, arXiv:1305.6126.
   Google Scholar
• [Etzion and Silberstein 13] T. Etzion and N. Silberstein. “Codes and Designs Related to Lifted MRD Codes.” IEEE Trans. Inf. Theory 59 (2013), 1004–1017.
   Web of Science ®Google Scholar
• [Etzion and Vardy 11] T. Etzion and A. Vardy. “Error-correcting Codes in Projective Space.” IEEE Trans. Inf. Theory 57 (2011), 1165–1173.
   Web of Science ®Google Scholar
• [Honold et al. 15] T. Honold, M. Kiermaier, and S. Kurz. “Optimal Binary Subspace Codes of Length 6, Constant Dimension 3 and Minimum Subspace Distance 4.” In Topics in Finite Fields, Contemporary Mathematics, vol. 632, edited by G. Kyureghyan, G. L. Mullen, and A. Pott, pp. 157–176. Providence, RI: American Mathematical Society, 2015.
   Google Scholar
• [Huppert 67] B. Huppert. Endliche Gruppen I. Berlin: Springer-Verlag, 1967.
   Google Scholar
• [Kantor 80] W. M. Kantor. “Linear Groups Containing a Singer Cycle.” J. Algebra 62 (1980), 232–234.
   Web of Science ®Google Scholar
• [Khaleghi et al. 09] A. Khaleghi, D. Silva, and F. R. Kschischang. “Subspace Codes.” In Cryptography and Coding. LNCS Vol. 5921, edited by M. G. Parker, pp. 1–21. Berlin: Springer, 2009.
   Google Scholar
• [Kohnert and Kurz 08] A. Kohnert and S. Kurz. “Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance.” In Mathematical Methods in Computer Science, LNCS Vol. 5393, edited by J. Calmet, W. Geiselmann, and J. Müller-Quade, pp. 31–42. Berlin: Springer, 2008.
   Google Scholar
• [Kötter and Kschischang 08] R. Kötter and F. R. Kschischang. “Coding for Errors and Erasures in Random Network Coding.” IEEE Trans. Inf. Theory 54 (2008), 3579–3591.
   Web of Science ®Google Scholar
• [Kramer and Mesner 76] E. S. Kramer and D. M. Mesner. “t-Designs on Hypergraphs.” Discrete Math. 15 (1976), 263–296.
   Web of Science ®Google Scholar
• [Kschischang 12] F. R. Kschischang. “An Introduction to Network Coding.” In Network Coding: Fundamentals and Applications, edited by M. Médard and A. Sprintson, pp. 1–37. Amsterdam: Elsevier, 2012.
   Google Scholar
• [Kurz preprint] S. Kurz. “Improved Upper Bounds for Partial Spreads.” Preprint, arXiv:1512.04297.
   Google Scholar
• [Mathew and Östergård to appear] K. A. Mathew and P. R. J. Östergård. “New Lower Bounds for the Shannon Capacity of Odd Cycles.” Des. Codes Cryptogr.
   Web of Science ®Google Scholar
• [Miyakawa et al. 95] M. Miyakawa, A. Munemasa, and S. Yoshiara. “On A Class of Small 2-Designs Over GF(q).” J. Combin. Des. 3 (1995), 61–77.
   Google Scholar
• [Montemanni and Smith 09] R. Montemanni and D. H. Smith. “Heuristic Algorithms for Constructing Binary Constant Weight Codes.” IEEE Trans. Inf. Theory 55 (2009), 4651–4656.
   Web of Science ®Google Scholar
• [Năstase and Sissokho preprint] E. Năstase and P. Sissokho. “The Maximum Size of A Partial Spread in A Finite Projective Space.” Preprint, arXiv:1605.04824.
   Google Scholar
• [Niskanen and Östergård 03] S. Niskanen and P. R. J. Östergård. “Cliquer User’s Guide, version 1.0, Technical Report T48, Communications Laboratory, Helsinki University of Technology, Espoo, 2003.
   Google Scholar
• [Pullan 09] W. Pullan. “Optimisation of Unweighted/Weighted Maximum Independent Sets and Minimum Vertex Covers.” Discrete Optim. 6 (2009), 214–219.
   Web of Science ®Google Scholar