Radical Computation for Small Characteristics

Ryutaroh Matsumoto ()
Additional contact information
Ryutaroh Matsumoto: Tokyo Institute of Technology, Department of Communications and Integrated Systems

A chapter in Gröbner Bases, Coding, and Cryptography, 2009, pp 427-430 from Springer

Abstract: Abstract In applications to coding theory and cryptography, the characteristic of the coefficient field is often small or 2. We will briefly review an algorithm computing the radical of a polynomial ideal specialized for small characteristics.

Keywords: Positive Characteristic; Polynomial Ring; Computer Algebra System; Polynomial Ideal; Noetherian Ring (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-93806-4_33

Ordering information: This item can be ordered from
http://www.springer.com/9783540938064

DOI: 10.1007/978-3-540-93806-4_33

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().