Search
ChatPaper
AI Writing
analysis
Analysis
编组
Open Data
more
More
RankingsMust ReadingJournal&ConferenceAI TRAI HistoryMaster Reading TreeXiaomai's Star TalentsTrajectoryTalentNDI TrackerOpenAI sign Language
VIPCreated with Sketch.

Trial Set and Grobner Bases for Binary Codes

Mijail Borges-Quintana,Miguel A. Borges-Trenard,Edgar Martinez-Moro

Springer Proceedings in Mathematics & Statistics（2017）

Cited 0|Views6
No score
Abstract
In this work, we show the connections between trial sets and Grobner bases for binary codes, which give characterizations of trial sets in the context of Grobner bases and algorithmic ways for computing them. In this sense, minimal trial sets will be characterized as trial sets associated with minimal Grobner bases of the ideal associated to a code.
More
Translated text
Key words
Binary linear codes,Test set,Groebner basis
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined