Triple cyclic codes over Z₂

From MaRDI portal
Publication:4593516




Abstract: Let r,s,t be three positive integers and mathcalC be a binary linear code of lenght r+s+t. We say that mathcalC is a triple cyclic code of lenght (r,s,t) over mathbbZ2 if the set of coordinates can be partitioned into three parts that any cyclic shift of the coordinates of the parts leaves invariant the code. These codes can be considered as mathbbZ2[x]-submodules of fracmathbbZ2[x]langlexr1angleimesfracmathbbZ2[x]langlexs1angleimesfracmathbbZ2[x]langlext1angle. We give the minimal generating sets of this kind of codes. Also, we determine the relationship between the generators of triple cyclic codes and their duals.









This page was built for publication: Triple cyclic codes over \(\mathbb Z_2\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593516)