The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Vassili C. Mavron: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. T. P. McDonough, Vassili C. Mavron
    Symmetric designs and geometroids. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:1, pp:51-57 [Journal]
  2. Vassili C. Mavron
    Frequency Squares and Affine Designs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  3. Vassili C. Mavron
    A Construction Method for Complete Sets of Mutually Orthogonal Frequency Squares. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  4. Vassili C. Mavron, T. P. McDonough, Mohan S. Shrikhande
    Quasi-Symmetric Designs with Good Blocks and Intersection Number One. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:28, n:2, pp:147-162 [Journal]
  5. Vassili C. Mavron, W. D. Wallis
    Cubic Arcs in Cubic Nets. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1993, v:3, n:2, pp:99-104 [Journal]
  6. A. N. Al-Kenani, Vassili C. Mavron
    Maximal arc partitions of designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:294, n:1-2, pp:5-11 [Journal]
  7. Jennifer D. Key, T. P. McDonough, Vassili C. Mavron
    Partial permutation decoding for codes from finite planes. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:665-682 [Journal]
  8. Dieter Jungnickel, Vassili C. Mavron, T. P. McDonough
    The Geometry of Frequency Squares. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:96, n:2, pp:376-387 [Journal]
  9. Vassili C. Mavron
    Translations and Parallel Classes of Lines in Affine Designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1977, v:22, n:3, pp:322-330 [Journal]
  10. Vassili C. Mavron
    Translations and Construction of Generalised Nets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1982, v:33, n:3, pp:316-339 [Journal]

  11. On affine designs and Hadamard designs with line spreads. [Citation Graph (, )][DBLP]


  12. Reed-Muller codes and permutation decoding. [Citation Graph (, )][DBLP]


  13. An upper bound for the minimum weight of the dual codes of desarguesian planes. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
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 asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002