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
18
click to vote
CORR
2007
Springer
favorite
Email
discuss
report
107
views
Education
»
more
CORR 2007
»
Bounds on ordered codes and orthogonal arrays
14 years 12 days ago
Download
www.ece.umd.edu
— We prove several new bounds on ordered codes and ordered orthogonal arrays. We also show that the eigenvalues of the ordered Hamming scheme are the multivariable Krawtchouk polynomials and establish some of their properties.
Alexander Barg, Punarbasu Purkayastha
Real-time Traffic
CORR 2007
|
Education
|
Hamming Scheme
|
Multivariable Krawtchouk Polynomials
|
Orthogonal Arrays
|
claim paper
Post Info
More Details (n/a)
Added
13 Dec 2010
Updated
13 Dec 2010
Type
Journal
Year
2007
Where
CORR
Authors
Alexander Barg, Punarbasu Purkayastha
Comments
(0)
Researcher Info
Education Study Group
Computer Vision