Discrete Applied Mathematics
Packet coding performance with correlated fading and shadowing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Sets of orthogonal hypercubes of class r
Journal of Combinatorial Theory Series A
Flashback: decoupled lightweight wireless control
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Flashback: decoupled lightweight wireless control
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
| Hi-index | 754.84 |
Aq-nary error-correcting code withN = q^{k}code words of lengthn = k + rcan have no greater minimum distancedthanr+1. The class of codes for whichd = r+1is studied first in general, then with the restriction that the codes be linear. Examples and construction methods are given to show that these codes exist for a number of values ofq, k, andr.