Follow
Asit Kumar Pradhan
Asit Kumar Pradhan
Verified email at arizona.edu
Title
Cited by
Cited by
Year
Polar coding and random spreading for unsourced multiple access
AK Pradhan, VK Amalladinne, KR Narayanan, JF Chamberland
ICC 2020-2020 IEEE International Conference on Communications (ICC), 1-6, 2020
912020
Unsourced random access with coded compressed sensing: Integrating AMP and belief propagation
VK Amalladinne, AK Pradhan, C Rush, JF Chamberland, KR Narayanan
IEEE Transactions on Information Theory 68 (4), 2384-2409, 2021
602021
A joint graph based coding scheme for the unsourced random access Gaussian channel
A Pradhan, V Amalladinne, A Vem, KR Narayanan, JF Chamberland
2019 IEEE Global Communications Conference (GLOBECOM), 1-6, 2019
592019
Construction of near-capacity protograph LDPC code sequences with block-error thresholds
AK Pradhan, A Thangaraj, A Subramanian
IEEE Transactions on Communications 64 (1), 27-37, 2015
372015
LDPC codes with soft interference cancellation for uncoordinated unsourced multiple access
AK Pradhan, VK Amalladinne, KR Narayanan, JF Chamberland
ICC 2021-IEEE International Conference on Communications, 1-6, 2021
272021
On approximate message passing for unsourced access with coded compressed sensing
VK Amalladinne, AK Pradhan, C Rush, JF Chamberland, KR Narayanan
2020 IEEE International Symposium on Information Theory (ISIT), 2995-3000, 2020
272020
Factored LT and factored raptor codes for large-scale distributed matrix multiplication
AK Pradhan, A Heidarzadeh, KR Narayanan
IEEE Journal on Selected Areas in Information Theory 2 (3), 893-906, 2021
212021
Deterministic constructions for large girth protograph LDPC codes
AK Pradhan, A Subramanian, A Thangaraj
2013 IEEE International Symposium on Information Theory, 1680-1684, 2013
182013
Sparse IDMA: A joint graph-based coding scheme for unsourced random access
AK Pradhan, VK Amalladinne, A Vem, KR Narayanan, JF Chamberland
IEEE Transactions on Communications 70 (11), 7124-7133, 2022
162022
Soft syndrome decoding of quantum LDPC codes for joint correction of data and syndrome errors
N Raveendran, N Rengaswamy, AK Pradhan, B Vasić
2022 IEEE International Conference on Quantum Computing and Engineering (QCE …, 2022
142022
Approximate support recovery using codes for unsourced multiple access
M Gkagkos, AK Pradhan, V Amalladinne, K Narayanan, JF Chamberland, ...
2021 IEEE International Symposium on Information Theory (ISIT), 2948-2953, 2021
102021
Protograph LDPC codes with block thresholds: Extension to degree-one and generalized nodes
AK Pradhan, A Thangaraj
IEEE Transactions on Communications 66 (12), 5876-5887, 2018
82018
Product lagrange coded computing
AM Subramaniam, A Heidarzadeh, AK Pradhan, KR Narayanan
2020 IEEE International Symposium on Information Theory (ISIT), 197-202, 2020
62020
Errors and erasures decoding of product codes for optical transport networks
DK Soma, AK Pradhan, K Narayanan
IEEE Communications Letters 25 (8), 2482-2486, 2021
52021
Squeezed Random Khatri-Rao Product Codes
R Ji, AK Pradhan, A Heidarzadeh, KR Narayanan
2021 IEEE Information Theory Workshop (ITW), 1-6, 2021
42021
Near-capacity protograph doubly-generalized LDPC codes with block thresholds
AK Pradhan, A Thangaraj
2016 IEEE International Symposium on Information Theory (ISIT), 2534-2538, 2016
42016
An exploration of the heterogeneous unsourced MAC
A Hao, S Rini, V Amalladinne, AK Pradhan, JF Chamberland
arXiv preprint arXiv:2011.10900, 2020
22020
Quaternary-Binary Message-Passing Decoder for Quantum LDPC Codes
D Chytas, N Raveendran, AK Pradhan, B Vasić
GLOBECOM 2023-2023 IEEE Global Communications Conference, 1393-1398, 2023
2023
Soft syndrome iterative decoding of quantum LDPC codes and hardware architectures
N Raveendran, J Valls, AK Pradhan, N Rengaswamy, F Garcia-Herrero, ...
EPJ Quantum Technology 10 (1), 45, 2023
2023
Learning to Decode Trapping Sets in QLDPC Codes
AK Pradhan, N Raveendran, N Rengaswamy, X Xiao, B Vasić
2023 12th International Symposium on Topics in Coding (ISTC), 1-5, 2023
2023
The system can't perform the operation now. Try again later.
Articles 1–20