Bounds on the asymptotic rate of binary constant subblock-composition codes.
Anshoo TandonHan Mao KiahMehul MotaniPublished in: ISIT (2017)
Keyphrases
- worst case
- code length
- rates of convergence
- large deviations
- logical operations
- upper bound
- error correcting
- asymptotically optimal
- finite sample
- gray code
- error correction
- lower bound
- closed form expressions
- error correcting codes
- vc dimension
- expected values
- asymptotic optimality
- binary codes
- contingency tables
- music composition
- uniform convergence
- data sets
- average case
- upper and lower bounds
- lower and upper bounds
- np hard
- genetic algorithm
- neural network