ORBGRAND with Prog-ROCC for High-Bandwidth Channels

Συγγραφείς: Griffin, Joseph C., Duffy, Ken R., Medard, Muriel

Πηγή: 2025 59th Asilomar Conference on Signals, Systems, and Computers Signals, Systems, and Computers, 2025 59th Asilomar Conference on. :582-588 Oct, 2025

Relation: 2025 59th Asilomar Conference on Signals, Systems, and Computers

List-Recovery of Random Linear Codes Over Small Fields

Συγγραφείς: Doron, D., Mosheiff, J., Resch, N., Ribeiro, J.

Πηγή: IEEE Transactions on Information Theory IEEE Trans. Inform. Theory Information Theory, IEEE Transactions on. 71(12):9548-9562 Dec, 2025

Constrained Symbol-Level Noise-Guessing Decoding With Antenna Sorting for Massive MIMO

Συγγραφείς: Allahkaram, S., Monteiro, F.A., Chatzigeorgiou, I.

Πηγή: IEEE Open Journal of the Communications Society IEEE Open J. Commun. Soc. Communications Society, IEEE Open Journal of the. 6:9486-9503 2025

Fault-Tolerant Noise Guessing Decoding of Quantum Random Codes

Συγγραφείς: Cruz, D., Monteiro, F.A., Roque, A., Coutinho, B.C.

Πηγή: IEEE Transactions on Quantum Engineering IEEE Trans. Quantum Eng. Quantum Engineering, IEEE Transactions on. 6:1-26 2025

Intelligent Seamless Handover in Next-Generation Networks

Συγγραφείς: Al-Khalidi, M., Al-Zaidi, R., Thomos, N., Reed, M.J.

Πηγή: IEEE Transactions on Consumer Electronics IEEE Trans. Consumer Electron. Consumer Electronics, IEEE Transactions on. 70(1):1566-1579 Feb, 2024

GRAND for Rayleigh Fading Channels

Συγγραφείς: Abbas, Syed Mohsin, Jalaleddine, Marwan, Gross, Warren J.

Πηγή: 2022 IEEE Globecom Workshops (GC Wkshps) Globecom Workshops (GC Wkshps), 2022 IEEE. :504-509 Dec, 2022

Relation: 2022 IEEE Globecom Workshops (GC Wkshps)

Punctured Low-Bias Codes Behave Like Random Linear Codes

Συγγραφείς: Guruswami, Venkatesan, Mosheiff, Jonathan

Πηγή: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2022 IEEE 63rd Annual Symposium on. :36-45 Oct, 2022

Relation: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)

URLLC with Coded Massive MIMO via Random Linear Codes and GRAND

Συγγραφείς: Allahkaram, Sahar, Monteiro, Francisco A., Chatzigeorgiou, Ioannis

Πηγή: 2022 IEEE 96th Vehicular Technology Conference (VTC2022-Fall) Vehicular Technology Conference (VTC2022-Fall), 2022 IEEE 96th. :1-5 Sep, 2022

Relation: 2022 IEEE 96th Vehicular Technology Conference (VTC2022-Fall)

Threshold Rates of Code Ensembles: Linear Is Best: Threshold rates of code ensembles: linear is best

Συγγραφείς: Nicolas Resch, Chen Yuan 0003

Συνεισφορές: Nicolas Resch and Chen Yuan, Bojańczyk, M., Merelli, E., Woodruff, D.P.

Πηγή: IEEE Transactions on Information Theory. 70:4823-4842

Θεματικοί όροι: FOS: Computer and information sciences, combinatorial properties of random linear codes, Burst-correcting codes, Threshold Rates, Computer Science - Information Theory, Information Theory (cs.IT), Random Linear Codes, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 0202 electrical engineering, electronic engineering, information engineering, List-Decoding, List-Recovery, Linear codes (general theory)

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2205.01513
https://zbmath.org/7884985
https://doi.org/10.1109/tit.2024.3357703
https://handle.uba.uva.nl/personal/pure/en/publications/threshold-rates-of-code-ensembles(5bd48c02-ee4e-42e8-a7f1-5b90bb3eb98b).html
https://doi.org/10.1109/TIT.2024.3357703
https://hdl.handle.net/11245.1/5bd48c02-ee4e-42e8-a7f1-5b90bb3eb98b
https://handle.uba.uva.nl/personal/pure/en/publications/threshold-rates-of-code-ensembles-linear-is-best(dc12cbb2-e5a9-49de-bba5-dd1cd352751d).html
https://hdl.handle.net/11245.1/dc12cbb2-e5a9-49de-bba5-dd1cd352751d
https://doi.org/10.48550/arXiv.2205.01513
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.104
https://ir.cwi.nl/pub/31744
https://doi.org/10.4230/lipics.icalp.2022.104

Symbol-Level GRAND for High-Order Modulation Over Block Fading Channels

Συγγραφείς: Chatzigeorgiou, I., Monteiro, F.A.

Πηγή: IEEE Communications Letters IEEE Commun. Lett. Communications Letters, IEEE. 27(2):447-451 Feb, 2023

Keep the Bursts and Ditch the Interleavers

Συγγραφείς: An, W., Medard, M., Duffy, K.R.

Πηγή: IEEE Transactions on Communications IEEE Trans. Commun. Communications, IEEE Transactions on. 70(6):3655-3667 Jun, 2022

Bounds for List-Decoding and List-Recovery of Random Linear Codes

Συγγραφείς: Guruswami, V., Li, R., Mosheiff, J., Resch, N., Silas, S., Wootters, M.

Πηγή: IEEE Transactions on Information Theory IEEE Trans. Inform. Theory Information Theory, IEEE Transactions on. 68(2):923-939 Feb, 2022

Keep the bursts and ditch the interleavers

Συγγραφείς: An, Wei, Medard, Muriel, Duffy, Ken R.

Πηγή: GLOBECOM 2020 - 2020 IEEE Global Communications Conference Global Communications Conference (GLOBECOM), 2020 IEEE. :1-6 Dec, 2020

Relation: GLOBECOM 2020 - 2020 IEEE Global Communications Conference

Bounds on the size of (r,δ)-locally repairable codes for fixed values q and d

Συγγραφείς: Zhang, Wenqin ^a, Yuan, Chen ^b, Luo, Yuan ^{b, ⁎}, Li, Nian ^a

Πηγή: In Finite Fields and Their Applications January 2026 109

Coded Computing via Binary Linear Codes: Designs and Performance Limits

Συγγραφείς: Soleymani, M., Jamali, M.V., Mahdavifar, H.

Πηγή: IEEE Journal on Selected Areas in Information Theory IEEE J. Sel. Areas Inf. Theory Selected Areas in Information Theory, IEEE Journal on. 2(3):879-892 Sep, 2021

Improved List-Decodability of Random Linear Binary Codes

Συγγραφείς: Li, R., Wootters, M.

Πηγή: IEEE Transactions on Information Theory IEEE Trans. Inform. Theory Information Theory, IEEE Transactions on. 67(3):1522-1536 Mar, 2021

Weight distribution of random linear codes and Krawtchouk polynomials

Συγγραφείς: Alex Samorodnitsky

Πηγή: Random Structures & Algorithms. 65:261-274

Θεματικοί όροι: FOS: Computer and information sciences, Combinatorial codes, Computer Science - Information Theory, Information Theory (cs.IT), random linear codes, weight distribution, 02 engineering and technology, 01 natural sciences, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Mathematics - Combinatorics, Krawtchouk polynomials, Combinatorics (math.CO), 0101 mathematics, Linear codes (general theory)

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2205.02051

Near-Optimal List-Recovery of Linear Code Families

Συγγραφείς: Li, Ray, Shagrithaya, Nikhil

Συνεισφορές: Ray Li and Nikhil Shagrithaya

Πηγή: CoRR.

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Information Theory, Information Theory (cs.IT), FOS: Mathematics, Mathematics - Combinatorics, Random Linear Codes, Combinatorics (math.CO), Error-Correcting Codes, Randomness, List-Recovery, Reed-Solomon Codes

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2502.13877
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2025.53

List-Recovery of Random Linear Codes over Small Fields

Συγγραφείς: Doron, Dean, Mosheiff, Jonathan, Resch, Nicolas, Ribeiro, João

Συνεισφορές: Dean Doron and Jonathan Mosheiff and Nicolas Resch and João Ribeiro

Θεματικοί όροι: List recovery, random linear codes

Περιγραφή αρχείου: application/pdf

Relation: Is Part Of LIPIcs, Volume 353, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2025.57

Διαθεσιμότητα: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2025.57
https://nbn-resolving.org/urn:nbn:de:0030-drops-244239
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2025.57

New non-asymptotic random channel coding theorems

Συγγραφείς: Yang, En-hui, Meng, Jin

Πηγή: 2013 Information Theory and Applications Workshop (ITA) Information Theory and Applications Workshop (ITA), 2013. :1-8 Feb, 2013

Relation: 2013 Information Theory and Applications Workshop (ITA)