@article {IOPORT.01392726,
    author       = {Cohen, G. and Rif\`a, J. and Tena, J. and Z\'emor, G.},
    title        = {On the characterization of linear uniquely decodable codes.},
    year         = {1999},
    journal      = {Designs, Codes and Cryptography},
    volume       = {17},
    number       = {1-3},
    issn         = {0925-1022},
    pages        = {87-96},
    publisher    = {Springer, Norwell, MA},
    doi          = {10.1023/A:1008306605740},
    abstract     = {A uniquely decodable (UD) code is a code such that any vector of the ambient space has a unique closest codeword. After the introduction, in Section 2, the authors investigate the structure of general binary linear UD code and identify perfect subcodes. In Section 3 these results are applied to solve the existence problem for UD codes in the case when the covering radius $\rho\leq 2$. Finally, nonlinear and nonbinary versions of Section 2 are envisaged.},
    reviewer     = {K.Lindstr\"om (Turku)},
    identifier   = {01392726},
}