Codes from symmetric polynomials

dc.contributor.author	Johnsen, Trygve
dc.contributor.author	Datta, Mrinmoy
dc.date.accessioned	2022-11-02T10:18:22Z
dc.date.available	2022-11-02T10:18:22Z
dc.date.issued	2022-10-10
dc.description.abstract	We define and study a class of Reed–Muller type error-correcting codes obtained from elementary symmetric functions in finitely many variables. We determine the code parameters and higher weight spectra in the simplest cases.	en_US
dc.identifier.citation	Johnsen T, Datta M. Codes from symmetric polynomials. Designs, Codes and Cryptography. 2022	en_US
dc.identifier.cristinID	FRIDAID 2065922
dc.identifier.doi	10.1007/s10623-022-01123-2
dc.identifier.issn	0925-1022
dc.identifier.issn	1573-7586
dc.identifier.uri	https://hdl.handle.net/10037/27233
dc.language.iso	eng	en_US
dc.publisher	Springer	en_US
dc.relation.journal	Designs, Codes and Cryptography
dc.relation.projectID	Tromsø forskningsstiftelse: Pure Mathematics in Norway	en_US
dc.relation.projectID	Norges forskningsråd: 280731	en_US
dc.rights.accessRights	openAccess	en_US
dc.rights.holder	Copyright 2022 The Author(s)	en_US
dc.rights.uri	https://creativecommons.org/licenses/by/4.0	en_US
dc.rights	Attribution 4.0 International (CC BY 4.0)	en_US
dc.title	Codes from symmetric polynomials	en_US
dc.type.version	acceptedVersion	en_US
dc.type	Journal article	en_US
dc.type	Tidsskriftartikkel	en_US
dc.type	Peer reviewed	en_US

Except where otherwise noted, this item's license is described as Attribution 4.0 International (CC BY 4.0)