Multiple-Rate Channel Codes in $\texttt{GF}(p^{n^{2}})$
R. S. Raja Durai, Ashwini Kumar

TL;DR
This paper introduces a novel multiple-rate coding scheme over GF(q^n) that allows encoding messages of arbitrary lengths using existing codes over GF(q), supported by a simple decoding strategy with orthogonal projectors.
Contribution
It proposes a new method to derive variable-rate codes from fixed-rate codes over composite fields, enabling flexible message lengths and rates.
Findings
Supports encoding messages of arbitrary lengths within a fixed blocklength.
Provides a decoding strategy using orthogonal projectors for variable-length messages.
Enables multiple code rates from a single fixed blocklength code.
Abstract
A code defined over is conventionally designed to encode a -symbol user data into a codeword of length , resulting in a fixed-rate coding. This paper proposes a coding procedure to derive a multiple-rate code from existing channel codes defined over a composite field . Formally, by viewing a symbol of as an -tuple over the base field , the proposed coding scheme employs children codes defined over to encode user messages of arbitrary lengths and incorporates a variable-rate feature. In sequel, unlike the conventional block codes of length , the derived multiple-rate code of fixed blocklength (over ) can be used to encode and decode user messages …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Cellular Automata and Applications
