A subspace subcode of Reed-Solomon (SSRS) [1] code is a subcode of a Reed-Solomon (RS) code (called the parent code) over $F_{p^m}$ consisting of codewords whose components all lie in a fixed v-dimensional $(over\hspace{5mm}F_p;\hspace{5mm}p-\hspace{5mm}a\hspace{5mm}prime)$ vector subspace V of $F_{p^}m$. In this paper we present a formula for the cardinality of an SSRS code by viewing V as an [m,v] linear code over $F_p$ with parity check matrix H. Our formula is in terms of H and counting the endomorphisms of $F_{p^m}$ satisfying certain conditions resulting from the DFT domain characterization of SSRS code
Subspace codes are subsets of the projective space P-q(n), which is the set of all subspaces of the ...
AbstractA class of maximum distance separable codes is introduced which includes Reed Solomon codes;...
In a recent paper, Brakensiek, Gopi and Makam introduced higher order MDS codes as a generalization ...
A subspace subcode of a Reed-Solomon (SSRS) code over GF(2m) is the set of RS code-words, whose comp...
Includes bibliographical references (p. 23-24)A fundamental problem in coding theory is to find code...
This article discusses the security of McEliece-like encryption schemes using subspace subcodes of R...
International audienceThis article discusses the security of McEliece-like encryption schemes using ...
International audienceThis article discusses the security of McEliece-like encryption schemes using ...
International audienceThis article discusses the security of McEliece-like encryption schemes using ...
International audienceThis article discusses the security of McEliece-like encryption schemes using ...
International audienceThis article discusses the security of McEliece-like encryption schemes using ...
In classical coding theory, different types of extendability results of codes are known. Aclassical ...
This article discusses the security of McEliece-like encryption schemes using subspace subcodes of R...
Subspace codes are subsets of the projective space P-q(n), which is the set of all subspaces of the ...
In classical coding theory, different types of extendability results of codes are known. Aclassical ...
Subspace codes are subsets of the projective space P-q(n), which is the set of all subspaces of the ...
AbstractA class of maximum distance separable codes is introduced which includes Reed Solomon codes;...
In a recent paper, Brakensiek, Gopi and Makam introduced higher order MDS codes as a generalization ...
A subspace subcode of a Reed-Solomon (SSRS) code over GF(2m) is the set of RS code-words, whose comp...
Includes bibliographical references (p. 23-24)A fundamental problem in coding theory is to find code...
This article discusses the security of McEliece-like encryption schemes using subspace subcodes of R...
International audienceThis article discusses the security of McEliece-like encryption schemes using ...
International audienceThis article discusses the security of McEliece-like encryption schemes using ...
International audienceThis article discusses the security of McEliece-like encryption schemes using ...
International audienceThis article discusses the security of McEliece-like encryption schemes using ...
International audienceThis article discusses the security of McEliece-like encryption schemes using ...
In classical coding theory, different types of extendability results of codes are known. Aclassical ...
This article discusses the security of McEliece-like encryption schemes using subspace subcodes of R...
Subspace codes are subsets of the projective space P-q(n), which is the set of all subspaces of the ...
In classical coding theory, different types of extendability results of codes are known. Aclassical ...
Subspace codes are subsets of the projective space P-q(n), which is the set of all subspaces of the ...
AbstractA class of maximum distance separable codes is introduced which includes Reed Solomon codes;...
In a recent paper, Brakensiek, Gopi and Makam introduced higher order MDS codes as a generalization ...