The order bound for the minimum distance of algebraic geometry codes is defined for the dual of one-point codes. A new bound for the minimum distance of linear codes, and for codes...
Olav Geil, Carlos Munuera, Diego Ruano, Fernando T...
In the study of multiple-access in the collision channel, conflict-avoiding code is used to guarantee that each transmitting user can send at least one packet successfully in the w...
— In this work, we examine a family of anti-collusion codes using the principle of “Orthogonal Spreading followed by the Inverse Fourier Transform (OSIFT)” as introduced in [...
In this paper, we study binary optimal odd formally self-dual codes. All optimal odd formally self-dual codes are classified for length up to 16. The highest minimum weight of any ...
Tandem connections of voice codecs can occur today in mobileto-mobile calls and for certain VoIP connections. While postfiltering in tandem encodings is well-understood, the effe...