Work

Computing Generating Sets for Quaternary Codes Using Gr{\"o}bner Bases

Year: 2013
Type: article
Abstract: Gröbner bases techniques can be used to compute a basis of a subspace of a finite-dimensional vector space over finite prime field given as a matrix kernel.Linear codes can be described as such subspaces and thus are an interesting area of application.Based on this, Gröbner bases techniques will be used to compute a generating set of a quaternary code given as a matrix kernel.In particular, if the quaternary code is free, the algorithm will provide a basis for the dual code.
Language: English
Open Access status: bronze
OpenAlex ID: W2320159293
FWCI:
Cites: 10
Cited by:
Related to: 10