Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 7
Number of items: 7
  • Polak, S. C. (2019). Semidefinite Programming Bounds For Constant-Weight Codes. IEEE Transactions on Information Theory, 65(1), 28-38. https://doi.org/10.1109/TIT.2018.2854800
  • Polak, S. C., & Schrijver, A. (2019). New lower bound on the Shannon capacity of C7 from circular graphs. Information Processing Letters, 143, 37-40. https://doi.org/10.1016/j.ipl.2018.11.006
  • Open Access
    Brouwer, A. E., & Polak, S. C. (2019). Uniqueness of codes using semidefinite programming. Designs, Codes and Cryptography, 87(8), 1881-1895. https://doi.org/10.1007/s10623-018-0589-8
  • Open Access
    Polak, S. C. (2019). New methods in coding theory: Error-correcting codes and the Shannon capacity. [Thesis, fully internal, Universiteit van Amsterdam].
  • Litjens, B., Polak, S., Sevenster, B., & Vena, L. (2018). On the chromatic number of a subgraph of the Kneser graph. Electronic Notes in Discrete Mathematics, 68, 227-232. https://doi.org/10.1016/j.endm.2018.06.039
  • Open Access
    Polak, S. C. (2018). New nonbinary code bounds based on divisibility arguments. Designs, Codes, and Cryptography, 86(4), 861–874. https://doi.org/10.1007/s10623-017-0366-0
  • Open Access
    Litjens, B., Polak, S., & Schrijver, A. (2017). Semidefinite bounds for nonbinary codes based on quadruples. Designs, Codes and Cryptography, 84(1-2), 87-100. https://doi.org/10.1007/s10623-016-0216-5
Page of