Computing Gröbner bases associated with lattices (Q340181): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GAP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3934/amc.2016045 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2547106885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4305609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trellis complexity and minimal trellis diagrams of lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tanner graphs for group block codes and lattices: construction and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5448204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Gröbner bases structure associated to linear codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gröbner bases and combinatorics for binary codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Gröbner bases by FGLM techniques in a non-commutative setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2902935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of zero-dimensional Gröbner bases by change of ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic structure of the minimal support codewords set of some linear codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4674258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The FGLM Problem and Möller’s Algorithm on Zero-dimensional Ideals / rank
 
Normal rank

Latest revision as of 23:13, 12 July 2024

scientific article
Language Label Description Also known as
English
Computing Gröbner bases associated with lattices
scientific article

    Statements

    Computing Gröbner bases associated with lattices (English)
    0 references
    0 references
    11 November 2016
    0 references
    The authors specialize Möller's algorithm to lattices by using an additive monoid structure for the lattice and by considering the application of Möller's algorithm to linear codes. The complexity issue is discussed.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Gröbner bases
    0 references
    Möller algorithm
    0 references
    lattices
    0 references
    label codes
    0 references
    group codes
    0 references
    0 references