Biography. Felice Manganiello is a Professor and Graduate Coordinator (Assistant Director for Graduate Studies) at Clemson University. His work centers on algebraic applications in communication, with a focus on coding theory, both classical and quantum; post-quantum cryptography; and secure distributed computing. His research contributions include a conjecture on cyclic orbit codes that spurred a decade of follow-up work, as well as interdisciplinary advances in distributed computation and secure matrix multiplication. He is also a co-developer of CROSS, a code-based digital signature scheme submitted to NIST. He has led major NSF-funded projects, including a $2.1 million RTG grant that supported more than 140 students and produced more than 50 peer-reviewed publications.
Mentorship is a cornerstone of his academic mission. He has advised a dozen of masters and PhD students and mentored five postdoctoral fellows, many of whom have gone on to tenure-track positions or impactful industry roles. He also supported undergraduate research through REU programs.
His service includes editorial and leadership roles at Clemson and in the broader research community. He is a Senior Member of the IEEE and serves on program committees for major conferences, including ISIT and CBCrypto.
Abstract. This talk explores the use of character maps to construct complex subspace codes from finite-field codes for communication over analog operator channels. We briefly discuss a limitation of additive characters: over extension fields, distinct polynomials can produce the same codeword, with redundancies described by trace maps and cyclotomic cosets. We then use multiplicative characters to construct complex subspace codes that preserve key parameters of their finite-field counterparts. We compare the subspace distance with the squared Frobenius distance between orthogonal projection matrices and discuss the implications for error-and-erasure correction. For lifted maximum-rank-distance codes, the resulting complex codes preserve minimum subspace distance and attain the largest possible cardinality within a specified family of codes. This talk is inspired by joint work with Sitraka Randrianarivo.