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

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

reviewed by

Ihsen Yengui

0 references

Mathematics Subject Classification ID

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

describes a project that uses

GAP

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.3934/amc.2016045

0 references

0 references

0 references

Trellis complexity and minimal trellis diagrams of lattices

0 references

Tanner graphs for group block codes and lattices: construction and complexity

0 references

Q5448204

0 references

On a Gröbner bases structure associated to linear codes

0 references

Gröbner bases and combinatorics for binary codes

0 references

Computing Gröbner bases by FGLM techniques in a non-commutative setting

0 references

Q2902935

0 references

Q3341887

0 references

Efficient computation of zero-dimensional Gröbner bases by change of ordering

0 references

Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm

0 references

Algebraic structure of the minimal support codewords set of some linear codes

0 references

Q4674258

0 references

The FGLM Problem and Möller’s Algorithm on Zero-dimensional Ideals

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:340181

@@ Property / review text @@
+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.
+Normal rank
@@ Property / reviewed by @@
+Ihsen Yengui
@@ Property / reviewed by: Ihsen Yengui / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+P10
@@ Property / Mathematics Subject Classification ID: 13P10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+G50
@@ Property / Mathematics Subject Classification ID: 14G50 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B05
@@ Property / Mathematics Subject Classification ID: 94B05 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6652418
@@ Property / zbMATH DE Number: 6652418 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Gröbner bases
@@ Property / zbMATH Keywords: Gröbner bases / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Möller algorithm
@@ Property / zbMATH Keywords: Möller algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+lattices
@@ Property / zbMATH Keywords: lattices / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+label codes
@@ Property / zbMATH Keywords: label codes / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+group codes
@@ Property / zbMATH Keywords: group codes / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+GAP
@@ Property / describes a project that uses: GAP / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.3934/amc.2016045
+Normal rank
@@ Property / OpenAlex ID @@
+W2547106885
@@ Property / OpenAlex ID: W2547106885 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4305609
@@ Property / cites work: Q4305609 / rank @@
+Normal rank
@@ Property / cites work @@
+Trellis complexity and minimal trellis diagrams of lattices
+Normal rank
@@ Property / cites work @@
+Tanner graphs for group block codes and lattices: construction and complexity
+Normal rank
@@ Property / cites work @@
+Q5448204
@@ Property / cites work: Q5448204 / rank @@
+Normal rank
@@ Property / cites work @@
+On a Gröbner bases structure associated to linear codes
+Normal rank
@@ Property / cites work @@
+Gröbner bases and combinatorics for binary codes
@@ Property / cites work: Gröbner bases and combinatorics for binary codes / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Gröbner bases by FGLM techniques in a non-commutative setting
+Normal rank
@@ Property / cites work @@
+Q2902935
@@ Property / cites work: Q2902935 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3341887
@@ Property / cites work: Q3341887 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient computation of zero-dimensional Gröbner bases by change of ordering
+Normal rank
@@ Property / cites work @@
+Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm
+Normal rank
@@ Property / cites work @@
+Algebraic structure of the minimal support codewords set of some linear codes
+Normal rank
@@ Property / cites work @@
+Q4674258
@@ Property / cites work: Q4674258 / rank @@
+Normal rank
@@ Property / cites work @@
+The FGLM Problem and Möller’s Algorithm on Zero-dimensional Ideals
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:340181