CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Graver bases and niversal Gröbner bases for linear codes
Authors
Natalia Dück
Karl-Heinz Zimmermann
Publication date
1 January 2015
Publisher
Academic Publ.
Doi
Cite
Abstract
A linear code over a finite field can be associated with two binomial ideals. In this paper, algorithms for computing their Graver bases and universal Gröbner bases are given
Similar works
Full text
Available Versions
TUHH Open Research (TORE)
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:tore.tuhh.de:11420/2661
Last time updated on 14/09/2020
Open Access Repository Technischen Universität Hamburg
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:tore.tuhh.de:11420/2661
Last time updated on 18/04/2020