ASKSAGE: Sage Q&A Forum - RSS feedhttps://ask.sagemath.org/questions/Q&A Forum for SageenCopyright Sage, 2010. Some rights reserved under creative commons license.Wed, 16 Aug 2023 00:41:58 +0200Representing Code over integer ringshttps://ask.sagemath.org/question/71320/representing-code-over-integer-rings/Is there a method to deal with all codewords over the integer rings `Z_n` where `n=p^k` for a prime `p`? I know that the linear codes over general rings has yet to be implemented. But at least over prime power integer rings, is it somehow possible to get the codewords? By codeword, I mean a submodule of a free-module over the ring, in this case `Z_n`.
Specifically, my aim is come with a framework for computing the various parameters of codes over non-field integer rings. A more typical example would be [this CCO paper](http://journal.azaruniv.ac.ir/article_14358_6d633266cc74c6c914ccd6c977624ff6.pdf) on simplex code. In the paper, the preliminaries (section 2) and the first three theorems describe the simplex codes for the submodule of the free module `Z_q^2`. Similarly, the sections 3 and 4 give the definitions and generator matrices for unit macdonald and simplex unit macdonald codes over the free module `Z_q^k` where `q` and `k` are any integers.
Any hints?Thanks beforehand.Mon, 31 Jul 2023 18:09:21 +0200https://ask.sagemath.org/question/71320/representing-code-over-integer-rings/Comment by vidyarthi for <p>Is there a method to deal with all codewords over the integer rings <code>Z_n</code> where <code>n=p^k</code> for a prime <code>p</code>? I know that the linear codes over general rings has yet to be implemented. But at least over prime power integer rings, is it somehow possible to get the codewords? By codeword, I mean a submodule of a free-module over the ring, in this case <code>Z_n</code>. </p>
<p>Specifically, my aim is come with a framework for computing the various parameters of codes over non-field integer rings. A more typical example would be <a href="http://journal.azaruniv.ac.ir/article_14358_6d633266cc74c6c914ccd6c977624ff6.pdf">this CCO paper</a> on simplex code. In the paper, the preliminaries (section 2) and the first three theorems describe the simplex codes for the submodule of the free module <code>Z_q^2</code>. Similarly, the sections 3 and 4 give the definitions and generator matrices for unit macdonald and simplex unit macdonald codes over the free module <code>Z_q^k</code> where <code>q</code> and <code>k</code> are any integers.
Any hints?Thanks beforehand.</p>
https://ask.sagemath.org/question/71320/representing-code-over-integer-rings/?comment=72580#post-id-72580@dan_fulea Modified the question. Added a reference. At least, if there was a workaround when `q` or `n` in this question is a prime power would be quite illuminating.Wed, 16 Aug 2023 00:41:58 +0200https://ask.sagemath.org/question/71320/representing-code-over-integer-rings/?comment=72580#post-id-72580Comment by dan_fulea for <p>Is there a method to deal with all codewords over the integer rings <code>Z_n</code> where <code>n=p^k</code> for a prime <code>p</code>? I know that the linear codes over general rings has yet to be implemented. But at least over prime power integer rings, is it somehow possible to get the codewords? By codeword, I mean a submodule of a free-module over the ring, in this case <code>Z_n</code>. </p>
<p>Specifically, my aim is come with a framework for computing the various parameters of codes over non-field integer rings. A more typical example would be <a href="http://journal.azaruniv.ac.ir/article_14358_6d633266cc74c6c914ccd6c977624ff6.pdf">this CCO paper</a> on simplex code. In the paper, the preliminaries (section 2) and the first three theorems describe the simplex codes for the submodule of the free module <code>Z_q^2</code>. Similarly, the sections 3 and 4 give the definitions and generator matrices for unit macdonald and simplex unit macdonald codes over the free module <code>Z_q^k</code> where <code>q</code> and <code>k</code> are any integers.
Any hints?Thanks beforehand.</p>
https://ask.sagemath.org/question/71320/representing-code-over-integer-rings/?comment=72114#post-id-72114We still need a definition or a reference of a "code", what are "codewords" (maybe of some code) and what kind of operations should be performed with it? Modules, which are submodules of a given (finite) ring $R$ are called ideals of the ring. All what we want from such an ideal $J$ of $R$ is to be a subset of $R$, closed/stable w.r.t. the ring operation. Since our $R$ of interest is cyclic, generated by one element, each ideal is also generated by one element. There is not too much to search for inside such a structure, at least from a/my theoretical point of view. Do we have any explicit example, is there any article doing so.Sun, 06 Aug 2023 20:45:26 +0200https://ask.sagemath.org/question/71320/representing-code-over-integer-rings/?comment=72114#post-id-72114Comment by dan_fulea for <p>Is there a method to deal with all codewords over the integer rings <code>Z_n</code> where <code>n=p^k</code> for a prime <code>p</code>? I know that the linear codes over general rings has yet to be implemented. But at least over prime power integer rings, is it somehow possible to get the codewords? By codeword, I mean a submodule of a free-module over the ring, in this case <code>Z_n</code>. </p>
<p>Specifically, my aim is come with a framework for computing the various parameters of codes over non-field integer rings. A more typical example would be <a href="http://journal.azaruniv.ac.ir/article_14358_6d633266cc74c6c914ccd6c977624ff6.pdf">this CCO paper</a> on simplex code. In the paper, the preliminaries (section 2) and the first three theorems describe the simplex codes for the submodule of the free module <code>Z_q^2</code>. Similarly, the sections 3 and 4 give the definitions and generator matrices for unit macdonald and simplex unit macdonald codes over the free module <code>Z_q^k</code> where <code>q</code> and <code>k</code> are any integers.
Any hints?Thanks beforehand.</p>
https://ask.sagemath.org/question/71320/representing-code-over-integer-rings/?comment=72112#post-id-72112Please use latex / mathjax to format mathematical expressions. So instead of `[math]\mathbb{Z}_n[/math]` simply `$\mathbb{Z}_n$`.Sun, 06 Aug 2023 20:37:25 +0200https://ask.sagemath.org/question/71320/representing-code-over-integer-rings/?comment=72112#post-id-72112Comment by vidyarthi for <p>Is there a method to deal with all codewords over the integer rings <code>Z_n</code> where <code>n=p^k</code> for a prime <code>p</code>? I know that the linear codes over general rings has yet to be implemented. But at least over prime power integer rings, is it somehow possible to get the codewords? By codeword, I mean a submodule of a free-module over the ring, in this case <code>Z_n</code>. </p>
<p>Specifically, my aim is come with a framework for computing the various parameters of codes over non-field integer rings. A more typical example would be <a href="http://journal.azaruniv.ac.ir/article_14358_6d633266cc74c6c914ccd6c977624ff6.pdf">this CCO paper</a> on simplex code. In the paper, the preliminaries (section 2) and the first three theorems describe the simplex codes for the submodule of the free module <code>Z_q^2</code>. Similarly, the sections 3 and 4 give the definitions and generator matrices for unit macdonald and simplex unit macdonald codes over the free module <code>Z_q^k</code> where <code>q</code> and <code>k</code> are any integers.
Any hints?Thanks beforehand.</p>
https://ask.sagemath.org/question/71320/representing-code-over-integer-rings/?comment=71370#post-id-71370@dan_fulea By codewords I mean a submodule over the ring [math]\mathbb{Z}_n[/math]. And yes, it is best to get them as a list. The main object is to study usual algebraic coding theory over these specific rings instead of the codes normally defined as vector spaces over fields.Tue, 01 Aug 2023 11:28:42 +0200https://ask.sagemath.org/question/71320/representing-code-over-integer-rings/?comment=71370#post-id-71370Comment by dan_fulea for <p>Is there a method to deal with all codewords over the integer rings <code>Z_n</code> where <code>n=p^k</code> for a prime <code>p</code>? I know that the linear codes over general rings has yet to be implemented. But at least over prime power integer rings, is it somehow possible to get the codewords? By codeword, I mean a submodule of a free-module over the ring, in this case <code>Z_n</code>. </p>
<p>Specifically, my aim is come with a framework for computing the various parameters of codes over non-field integer rings. A more typical example would be <a href="http://journal.azaruniv.ac.ir/article_14358_6d633266cc74c6c914ccd6c977624ff6.pdf">this CCO paper</a> on simplex code. In the paper, the preliminaries (section 2) and the first three theorems describe the simplex codes for the submodule of the free module <code>Z_q^2</code>. Similarly, the sections 3 and 4 give the definitions and generator matrices for unit macdonald and simplex unit macdonald codes over the free module <code>Z_q^k</code> where <code>q</code> and <code>k</code> are any integers.
Any hints?Thanks beforehand.</p>
https://ask.sagemath.org/question/71320/representing-code-over-integer-rings/?comment=71340#post-id-71340What is a codeword in or over $R=\Bbb Z/n$ (in the special case $n=p^k$)? What does it mean to "get" them? As a list? As an iterator? For which values of $n$, moderately big...?Tue, 01 Aug 2023 01:33:07 +0200https://ask.sagemath.org/question/71320/representing-code-over-integer-rings/?comment=71340#post-id-71340