Advanced results in enumeration of hyperfields

The purpose of this paper is to introducing a computational method to construction and classification of finite hyperfields (in the sense of Krasner). In this regards first we introduce a mathematical method to produce hyperfields from a family of a non-empty subsets of a given multiplicative group under specific conditions and then we apply this method to enumerate all finite hyperfields of order less that 7, up to isomorphism by a computer programming. Of course this program can be used to produce hyperfields of finite higher orders, but it’s commotional complexity is of high order and it must be used of very high-speed computers system.