Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Counting Subring-Subcodes of Free Linear Codes Over Finite Principal Ideal Rings

Published 7 Dec 2016 in cs.IT and math.IT | (1612.02213v1)

Abstract: Let $R$ be a finite principal ideal ring and $S$ the Galois extension of $R$ of degree $m$. For $k$ and $k_0$, positive integers we determine the number of free $S$-linear codes $B$ of length $l$ with the property $k = rank_S(B)$ and $k_0 = rank_R (B\cap Rl)$. This corrects a wrong result which was given in the case of finite fields.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.