Analysis of Generalized Implicit Transmission
Year: 2026
Type: article
Abstract: Introduction: In a recent study, a generalized implicit transmission (GIT) technique that can transmit multiple implicit sequences while transmitting a single explicit sequence over a channel has been introduced. Instead of treating all sequences as independent, as in the previous study, this study considers the explicit sequence and all implicit sequences of a GIT collectively as a single code, referred to as a GIT coding scheme. Methods: The overall code rate Roverall and the inherent coding gain achieved by a GIT coding scheme, due to the transmission of information, is discussed implicitly. A GIT coding scheme constructed from a rate R code to function as a rate Roverall code, on average, transmits Roverall/R number of codewords of a rate R code for every single codeword transmitted over the channel by transmitting (Roverall − R)/R number of codewords over all implicit sequences. A simple way to convert existing practical codes into GIT coding schemes is also discussed. Results: The numerical results presented with the LDPC codes employed in the WiFi and the 5G standards demonstrate that GIT coding schemes can achieve very high coding gains over conventional codes while functioning as high-rate codes. Conclusion: Due to its ability to transmit the majority of information implicitly, which does not require any additional bandwidth or transmitted power, it is demonstrated here that GIT coding schemes can operate in the so-called unreachable region relative to the Shannon-Hartley bound.
Authors: Dhanushki Hewawaduge, John P. Fonseka
Institution: The University of Texas at Dallas
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W7119511004