Articles with public access mandates - Roxana SmarandacheLearn more
Available somewhere: 12
Constructing strongly-MDS convolutional codes with maximum distance profile.
D Napp, R Smarandache
Adv. Math. Commun. 10 (2), 275-290, 2016
Mandates: US National Science Foundation, Fundação para a Ciência e a Tecnologia, Portugal
Designing protograph-based quasi-cyclic spatially coupled LDPC codes with large girth
S Mo, L Chen, DJ Costello, DGM Mitchell, R Smarandache, J Qiu
IEEE Transactions on Communications 68 (9), 5326-5337, 2020
Mandates: US National Science Foundation, National Natural Science Foundation of China
A protograph-based design of quasi-cyclic spatially coupled LDPC codes
L Chen, S Mo, DJ Costello, DGM Mitchell, R Smarandache
2017 IEEE International Symposium on Information Theory (ISIT), 1683-1687, 2017
Mandates: National Natural Science Foundation of China
A unifying framework to construct QC-LDPC tanner graphs of desired girth
R Smarandache, DGM Mitchell
IEEE Transactions on Information Theory 68 (9), 5802-5822, 2022
Mandates: US National Science Foundation
Reverse-maximum distance profile convolutional codes over the erasure channel
V Tomás, J Rosenthal, R Smarandache
Proceedings of the 19th International Symposium on Mathematical Theory of …, 2010
Mandates: Swiss National Science Foundation
Necessary and sufficient girth conditions for Tanner graphs of quasi-cyclic LDPC codes
R Smarandache, DGM Mitchell
2021 IEEE International Symposium on Information Theory (ISIT), 380-385, 2021
Mandates: US National Science Foundation
An efficient strategy to count cycles in the Tanner graph of quasi-cyclic LDPC codes
A Gómez-Fonseca, R Smarandache, DGM Mitchell
IEEE Journal on Selected Areas in Information Theory 4, 499-513, 2023
Mandates: US National Science Foundation
A low complexity PEG-like algorithm to construct quasi-cyclic LDPC codes
A Gómez-Fonseca, R Smarandache, DGM Mitchell
2023 12th International Symposium on Topics in Coding (ISTC), 1-5, 2023
Mandates: US National Science Foundation
Using minors to construct generator matrices for quasi-cyclic ldpc codes
R Smarandache, A Gómez-Fonseca, DGM Mitchell
2022 IEEE International Symposium on Information Theory (ISIT), 548-553, 2022
Mandates: US National Science Foundation
Necessary and sufficient girth conditions for LDPC Tanner graphs with denser protographs
A Gómez-Fonseca, R Smarandache, DGM Mitchell
2021 11th International Symposium on Topics in Coding (ISTC), 1-5, 2021
Mandates: US National Science Foundation
Free pseudodistance growth rates for spatially coupled LDPC codes over the BEC
C Zhou, DGM Mitchell, R Smarandache
2018 IEEE Information Theory Workshop (ITW), 1-5, 2018
Mandates: US National Science Foundation
On the Tanner Cycle Distribution of QC-LDPC Codes from Polynomial Parity-Check Matrices
A Gómez-Fonseca, R Smarandache, DGM Mitchell
2023 IEEE International Symposium on Information Theory (ISIT), 2356-2361, 2023
Mandates: US National Science Foundation
Publication and funding information is determined automatically by a computer program