On the lattice of cyclic codes over finite chain rings

dc.contributor.author	Fotue-Tabue, A.
dc.contributor.author	Mouaha, C.
dc.date.accessioned	2023-03-01T15:42:18Z
dc.date.available	2023-03-01T15:42:18Z
dc.date.issued	2019
dc.identifier.citation	On the lattice of cyclic codes over finite chain rings / A. Fotue-Tabue, C. Mouaha // Algebra and Discrete Mathematics. — 2019. — Vol. 27, № 2. — С. 252–268. — Бібліогр.: 15 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2010 MSC: 13B05, 94B05, 94B15, 03G10, 16P10.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/188436
dc.description.abstract	In this paper, R is a finite chain ring of invariants (q, s), and ℓ is a positive integer fulfilling gcd(ℓ, q) = 1. In the language of q-cyclotomic cosets modulo ℓ, the cyclic codes over R of length ℓ are uniquely decomposed into a direct sum of trace-representable cyclic codes over R and the lattice of cyclic codes over R of length ℓ is investigated.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	On the lattice of cyclic codes over finite chain rings	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA