Bounds on ordered codes and orthogonal arrays

13 years 4 months 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

» MDS Array Codes with Optimal Rebuilding

» Improved interference cancellation scheme for twouser detection of alamouti code

» Combining Beamforming and SpaceTime Coding Using Noisy Quantized Feedback

» Prolific Codes with the Identifiable Parent Property

» MinT Architecture and applications of the t m snet and OOA database

» Highrate diversity across time and frequency using linear dispersion

» High Rate SingleSymbol ML Decodable Precoded DSTBCs for Cooperative Networks

» Fast memory footprint estimation based on maximal dependency vector calculation

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)

Sciweavers

Bounds on ordered codes and orthogonal arrays

CORR 2007 | Education | Hamming Scheme | Multivariable Krawtchouk Polynomials | Orthogonal Arrays |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers