SearcharxivSearch

arXiv subjects

Harshithanjani Athi

Publications and source records attributed to Harshithanjani Athi.

3 recordsLinked to original sources

Deep-OFDM: Neural Modulation for High Mobility

Orthogonal Frequency Division Multiplexing (OFDM) is the dominant waveform in modern wireless systems, but suffers performance degradation in high-mobility environments due to Doppler-induced inter-carrier interference and unreliable pilot-based channel estimation. Neural receivers have recently shown strong performance in OFDM systems by learning equalization and detection directly from the received time-frequency grid. However, when channel estimation becomes unreliable, receiver-side learning alone is insufficient to fully recover performance. In this work we introduce DeepOFDM, a learnable modulation framework that augments conventional OFDM with a lightweight convolutional neural network (CNN) modulator jointly optimized with a neural receiver. Instead of mapping symbols independently to resource elements, DeepOFDM spreads information across local time-frequency neighborhoods while remaining fully compatible with FFT-based OFDM processing. The learned modulation breaks the rotational symmetry of conventional QAM constellations, enabling the receiver to infer residual phase directly from data symbols. This structure allows reliable operation with sparse pilots and even in fully pilotless settings. Extensive simulations demonstrate improvements in block error rate and goodput under high Doppler, while over-the-air experiments confirm practical feasibility. These results highlight the potential of transmitter-receiver co-design for robust and spectrally efficient AI-native physical layer design.

cs.IT

On Distributed Multi-User Secret Sharing with Multiple Secrets per User

We consider a distributed multi-user secret sharing (DMUSS) setting in which there is a dealer, $n$ storage nodes, and $m$ secrets. Each user demands a $t$-subset of $m$ secrets. Earlier work in this setting dealt with the case of $t=1$; in this work, we consider general $t$. The user downloads shares from the storage nodes based on the designed access structure and reconstructs its secrets. We identify a necessary condition on the access structures to ensure weak secrecy. We also make a connection between access structures for this problem and $t$-disjunct matrices. We apply various $t$-disjunct matrix constructions in this setting and compare their performance in terms of the number of storage nodes and communication complexity. We also derive bounds on the optimal communication complexity of a distributed secret sharing protocol. Finally, we characterize the capacity region of the DMUSS problem when the access structure is specified.

cs.IT

On the Structure of Higher Order MDS Codes

A code of length $n$ is said to be (combinatorially) $(ρ,L)$-list decodable if the Hamming ball of radius $ρn$ around any vector in the ambient space does not contain more than $L$ codewords. We study a recently introduced class of higher order MDS codes, which are closely related (via duality) to codes that achieve a generalized Singleton bound for list decodability. For some $\ell\geq 1$, higher order MDS codes of length $n$, dimension $k$, and order $\ell$ are denoted as $(n,k)$-MDS($\ell$) codes. We present a number of results on the structure of these codes, identifying the `extend-ability' of their parameters in various scenarios. Specifically, for some parameter regimes, we identify conditions under which $(n_1,k_1)$-MDS($\ell_1$) codes can be obtained from $(n_2,k_2)$-MDS($\ell_2$) codes, via various techniques. We believe that these results will aid in efficient constructions of higher order MDS codes. We also obtain a new field size upper bound for the existence of such codes, which arguably improves over the best known existing bound, in some parameter regimes.

cs.IT