Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
27
click to vote
DCC
2005
IEEE
favorite
Email
discuss
report
96
views
Computer Graphics
»
more
DCC 2005
»
A Family of Complete Caps in PG(n, 2)
15 years 2 days ago
Download
www.sfu.ca
We give a combinatorial construction of a one-parameter and a two-parameter family of complete caps in finite projective spaces over GF(2). As an application of our construction we find, for each
Petr Lisonek, Mahdad Khatirinejad
Real-time Traffic
Combinatorial Construction
|
Computer Graphics
|
DCC 2005
|
Finite Projective Spaces
|
claim paper
Post Info
More Details (n/a)
Added
25 Dec 2009
Updated
25 Dec 2009
Type
Conference
Year
2005
Where
DCC
Authors
Petr Lisonek, Mahdad Khatirinejad
Comments
(0)
Researcher Info
Computer Graphics Study Group
Computer Vision