95 citations · 186 across the 16 of their papers we have counts for
18 papers
Exact Cardinality And Nonredundant Parametrization Of Character-Polynomial Codes
Felice Manganiello, Sitraka Randrianarivo
Character-polynomial codes are constructed by evaluating finite field polynomials and mapping the results to complex roots of unity through additive characters. This paper shows th…
External Codes for Multiple Unicast Networks via Interference Alignment
F. R. Kschischang, F. Manganiello, A. Ravagnani +1
We introduce a formal framework to study the multiple unicast problem for a coded network in which the network code is linear over a finite field and fixed. We show that the proble…
CSS-T Codes from Reed Muller Codes
Emma Andrade, Jessalyn Bolkema, Thomas Dexter +4
CSS-T codes are a class of stabilizer codes introduced by Rengaswamy \emph{et al} with desired properties for quantum fault-tolerance. In this work, we comprehensively study non-de…
Root of Unity for Secure Distributed Matrix Multiplication: Grid Partition Case
Roberto Assis Machado, Felice Manganiello
We consider the problem of secure distributed matrix multiplication (SDMM), where a user has two matrices and wishes to compute their product with the help of honest but curiou…
Batch Codes from Affine Cartesian Codes and Quotient Spaces
Travis Baumbaugh, Haley Colgate, Timothy Jackman +1
Affine Cartesian codes are defined by evaluating multivariate polynomials at a cartesian product of finite subsets of a finite field. In this work we examine properties of these co…
Multicast Triangular Semilattice Network
Angelina Grosso, Felice Manganiello, Shiwani Varal +1
We investigate the structure of the code graph of a multicast network that has a characteristic shape of an inverted equilateral triangle. We provide a criterion that determines th…
Affine Cartesian codes with complementary duals
Hiram H. López, Felice Manganiello, Gretchen L. Matthews
A linear code with the property that is said to be a linear complementary dual, or LCD, code. In this paper, we consider generalized affine Cartesia…
Batch Codes from Hamming and Reed-Müller Codes
Travis Baumbaugh, Yariana Diaz, Sophia Friesenhahn +2
Batch codes, introduced by Ishai et al. encode a string into an -tuple of strings, called buckets. In this paper we consider multiset batch codes wherein a set of…
Matroidal Root Structure of Skew Polynomials over Finite Fields
Travis Baumbaugh, Felice Manganiello
A skew polynomial ring is a ring of polynomials with non-commutative multiplication. This creates a difference between left and right divisibility, and thus a concept…
Representations of the Multicast Network Problem
Sarah E. Anderson, Wael Halbawi, Nathan Kaplan +4
We approach the problem of linear network coding for multicast networks from different perspectives. We introduce the notion of the coding points of a network, which are edges of t…
Matroidal Structure of Skew Polynomial Rings with Application to Network Coding
Siyu Liu, Felice Manganiello, Frank R. Kschischang
Over a finite field , the evaluation of skew polynomials is intimately related to the evaluation of linearized polynomials. This connection allows one to relate t…
Codes for distributed storage from 3-regular graphs
Shuhong Gao, Fiona Knoll, Felice Manganiello +1
This paper considers distributed storage systems (DSSs) from a graph theoretic perspective. A DSS is constructed by means of the path decomposition of a 3- regular graph into P4 pa…
Cyclic Orbit Codes
Anna-Lena Trautmann, Felice Manganiello, Michael Braun +1
In network coding a constant dimension code consists of a set of k-dimensional subspaces of F_q^n. Orbit codes are constant dimension codes which are defined as orbits of a subgrou…
Spread Decoding in Extension Fields
Felice Manganiello, Anna-Lena Trautmann
A spread code is a set of vector spaces of a fixed dimension over a finite field Fq with certain properties used for random network coding. It can be constructed in different ways…
An Algebraic Approach for Decoding Spread Codes
Elisa Gorla, Felice Manganiello, Joachim Rosenthal
In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) wit…
On conjugacy classes of subgroups of the general linear group and cyclic orbit codes
Felice Manganiello, Anna-Lena Trautmann, Joachim Rosenthal
Orbit codes are a family of codes employable for communications on a random linear network coding channel. The paper focuses on the classification of these codes. We start by class…
Spread Codes and Spread Decoding in Network Coding
Felice Manganiello, Elisa Gorla, Joachim Rosenthal
In this paper we introduce the class of Spread Codes for the use in random network coding. Spread Codes are based on the construction of spreads in finite projective geometry. The…
Computation of the Weight Distribution of CRC Codes
Felice Manganiello
In this article, we illustrate an algorithm for the computation of the weight distribution of CRC codes. The recursive structure of CRC codes will give us an iterative way to compu…