1. When to Sample: Optimal Distributed Sampling for Detecting Inhomogeneous Poisson Sources - Vanlalruata Ralte
2. Blind Identification of Channel Codes: A Subspace-Coding Approach – Pramod Singh
3. Fundamental Bandwidth Limits for Parameter Scaling in Regenerating Codes – Vikrant Singh
4. Coprime Bivariate Bicycle Codes with Asymmetric Stabilizer Checks – Aswanth T
5. Correlated Quantization for Distributed Learning – Sourabh Tambi
6. Beyond Shannon in Non-Stationary Channels: Online Meta-Learning for Semantic Communications – Tanishq Singh Sisodiya
7. Parameter Estimation of Chirp-Like Signals using Differential Evolution based Least Squares Framework – Avantika Sahu
8. A Low-Rate Variable-Bias Integrate-and-Fire Time Encoding Machine – Anshu Arora
9. SCoPE: Sampling with Confidence via Predictive Information for Local Explanations – Sumedha Chugh
1. Information-Theoretic Weak Private Information Retrieval – Chandan Anand
2. Error Exponent Analysis for Joint Sensing and Communication over Gaussian Channels – Gokulan V P
3. Practical Coding Schemes for Weak Constraints – Prachi Mishra
4. On Eisenstein Additive Codes Over Chain Rings And Linear Codes Over Mixed Alphabets – Leijo Jose
5. Continual Learning via Constrained Stochastic Optimization: A Drift Plus Penalty Framework – Govinda Arya
6. Endogeny for the k-min Recursive Distributional Equation – Janaky Murthy
7. Data-Driven Analysis of 5G Spectrum Auctions: A Cross-Country Study – T Shantanu
8. Securing NB-IoT Uplink using Chaotic Phase Transformed Sequences – Sivarama Krishna Maladi
9. Optimal Linear Aggregation for Distributed k-NN: Theory and Approximations – Anant Jain
1. Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets – Hareshkumar Jadav
2. Mixing Time Bounds for Asymmetric Random Walks on Hypercubes, Cycles, and Tori Using Coupling – Mrudula A Mahindrakar
3. Construction of several infinite families of linear codes with new parameters: Hamming weight enumerators and hull dimensions – Lavanya G
4. Locally Maximal Recoverable Codes – Rajendra Prasad Rajpurohit
5. Sequential Clustering of Data Sequences under Fixed Confidence – Dhinesh Chandran G
6. Online Learning with Mixtures: Sub-Gaussian and Heavy-Tailed Mean Estimation – Panasuriya Tarang
7. CNN–BiLSTM Hybrid for 6G Traffic Classification: From Random Inputs to Real-World Data – Shree Goswami
8. Noise-Aware Retinex Decomposition with Poisson Modelling for Low-Light Image Enhancement – Ratul Chakraborty
9. Optimal Linear Aggregation for Distributed k-NN: Theory and Approximations – Abhiraj Raje
1. Capacity of Two Undirected Multiple-Unicast Networks With Arbitrary Demands – Medapalli Surya Vamsi
2. An efficient, sketch-based, iterative algorithm for minimum norm problems – Vishnu Shaju
3. Service Rate Region of Hamming Codes – Priyanka Choudhary
4. Learning in the Shadows: Adapting to Asynchronous Novelty in Continual Streams – Keshav Sharma
5. They’re Closer Than We Think: Tackling the Near-OOD Problem – Shaurya Bhatnagar
6. SARA-6G: Standards-Aligned Resource Allocation for 6G – Jaynil D Panjwani
7. DeepPolar+: Breaking the BER-BLER Trade-off via Self-Attention and SMART Decoding – Shubham Srivastava
8. Fractional Subadditivity of Submodular Functions: Equality Conditions and Their Applications – Gunank Singh
9. Perfect Secret Key Generation for Hypergraphical Sources – Sagnik Chatterjee
10. On the convergence of Perturbation-Robust Continual Federated Learning (PRO-CFL) – Zubair Shaban