z-logo
Premium
An efficient encoding and decoding algorithm for tracking circulation of commodity by discretizing information matrix
Author(s) -
Wan Guochun,
Lu Dongjie,
Tong Meisong
Publication year - 2016
Publication title -
international journal of numerical modelling: electronic networks, devices and fields
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.249
H-Index - 30
eISSN - 1099-1204
pISSN - 0894-3370
DOI - 10.1002/jnm.2169
Subject(s) - encoding (memory) , decoding methods , commodity , computer science , algorithm , matrix (chemical analysis) , construct (python library) , circulation (fluid dynamics) , tracking (education) , discretization , artificial intelligence , mathematics , engineering , economics , finance , psychology , mathematical analysis , pedagogy , materials science , composite material , programming language , aerospace engineering
Summary In this paper, an efficient encoding and decoding algorithm is developed for tracking circulation of commodity. We take a discrete and optimized approach to construct the encoding and decoding method by using a matrix as an information carrier. This method is more durable against the damage of outer packages and can obtain a high recovery rate of commodity's information. Generally, it is very diffcult to track the original information in the circulation of commodity. We use the optimized encoding method to link the original information of commodity with a database so that the commodity can be pinpointed in the whole circulation. Also, the original information can be restored by an efficient decoding algorithm whenever necessary. The optimized method is designed based on two traditional encoding and decoding methods, and these methods are compared by running certain simulations with a large number of testing data. The results show that the improved and optimized method can obtain a much higher recovery rate of commodity's information and is more durable against the damage of outer packages. Copyright © 2016 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here