We consider the space of ternary words of length n and fixed weight w with the usual Hamming distance. A sequence of perfect single error correcting codes in this space is construc...
Abstract. We discuss the problem of determining the complete weight hierarchy of linear error correcting codes associated to Grassmann varieties and, more generally, to Schubert va...
Sudhir R. Ghorpade, Arunkumar R. Patil, Harish K. ...
Network coding increases throughput and is robust against failures and erasures. However, since it allows mixing of information within the network, a single corrupted packet genera...
Abstract. A new, simple, approach for active steganography is proposed in this paper that can successfully resist recent blind steganalysis methods, in addition to surviving distor...
— A special kind of symbol-wise puncturing is applied to the code symbols of a constituent trellis coded modulation (TCM) within two very bandwidth-efficient concatenated coding...