The SCEAS System
Navigation Menu

Search the dblp DataBase


Gerzson Kéri: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gerzson Kéri, Ákos Kisvölcsey
    On Computing the Hamming Distance. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2004, v:16, n:3, pp:443-449 [Journal]
  2. Gerzson Kéri, Patric R. J. Östergård
    Bounds for Covering Codes over Large Alphabets. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:37, n:1, pp:45-60 [Journal]
  3. Gerzson Kéri, Patric R. J. Östergård
    Further results on the covering radius of small codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:1, pp:69-77 [Journal]

  4. Binary Covering Arrays and Existentially Closed Graphs. [Citation Graph (, )][DBLP]

  5. Covering and radius-covering arrays: Constructions and classification. [Citation Graph (, )][DBLP]

  6. The covering radius of extreme binary 2-surjective codes. [Citation Graph (, )][DBLP]

  7. On the minimum size of binary codes with length 2 R + 4 and covering radius R. [Citation Graph (, )][DBLP]

Search in 0.016secs, Finished in 0.016secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002