Papers
Topics
Authors
Recent
Search
2000 character limit reached

Properties of Constacyclic Codes Under the Schur Product

Published 17 Oct 2018 in cs.IT and math.IT | (1810.07630v2)

Abstract: For a subspace $W$ of a vector space $V$ of dimension $n$, the Schur-product space $W{\langle k\rangle}$ for $k \in \mathbb{N}$ is defined to be the span of all vectors formed by the component-wise multiplication of $k$ vectors in $W$. It is well known that repeated applications of the Schur product to the subspace $W$ creates subspaces $W, W{\langle 2 \rangle}, W{\langle 3 \rangle}, \ldots$ whose dimensions are monotonically non-decreasing. However, quantifying the structure and growth of such spaces remains an important open problem with applications to cryptography and coding theory. This paper characterizes how increasing powers of constacyclic codes grow under the Schur product and gives necessary and sufficient criteria for when powers of the code and or dimension of the code are invariant under the Schur product.

Citations (3)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.