Linear codes over F-q[u]/(u(s)) with respect to the Rosenbloom-Tsfasman metric

Özen, Mehmet

dc.contributor.authors	Ozen, M; Siap, I;
dc.date.accessioned	2020-01-17T08:21:39Z
dc.date.available	2020-01-17T08:21:39Z
dc.date.issued	2006
dc.identifier.citation	Ozen, M; Siap, I; (2006). Linear codes over F-q[u]/(u(s)) with respect to the Rosenbloom-Tsfasman metric. DESIGNS CODES AND CRYPTOGRAPHY, 38, 29-17
dc.identifier.issn	0925-1022
dc.identifier.uri	https://hdl.handle.net/20.500.12619/6029
dc.identifier.uri	https://doi.org/10.1007/s10623-004-5658-5
dc.description.abstract	We investigate the structure of codes over F-q[u]/(u(s)) rings with respect to the Rosenbloom-Tsfasman (RT) metric. We de. ne a standard form generator matrix and show how we can determine the minimum distance of a code by taking advantage of its standard form. We de. ne MDR (maximum distance rank) codes with respect to this metric and give the weights of the codewords of an MDR code. We explore the structure of cyclic codes over F-q[u]/(u(s)) and show that all cyclic codes over F-q[u]/(u(s)) rings are MDR. We propose a decoding algorithm for linear codes over these rings with respect to the RT metric.
dc.language	English
dc.publisher	SPRINGER
dc.subject	Mathematics
dc.title	Linear codes over F-q[u]/(u(s)) with respect to the Rosenbloom-Tsfasman metric
dc.type	Article
dc.identifier.volume	38
dc.identifier.startpage	17
dc.identifier.endpage	29
dc.contributor.department	Sakarya Üniversitesi/Fen-Edebiyat Fakültesi/Matematik Bölümü
dc.contributor.saüauthor	Özen, Mehmet
dc.relation.journal	DESIGNS CODES AND CRYPTOGRAPHY
dc.identifier.wos	WOS:000234209600002
dc.identifier.doi	10.1007/s10623-004-5658-5
dc.contributor.author	Özen, Mehmet