A compounded encoding and decoding algorithm for product tracing based on the information‐grayscale matrix

This paper proposes a compounded encoding and decoding algorithm based on the information‐grayscale matrix. Generally, it is very difficult to track the original information in the circulation of commodity. This algorithm is aimed to be applied to product tracing, especially fast‐moving consumer goo...

Full description

Saved in:
Bibliographic Details
Published in:International journal of numerical modelling Vol. 32; no. 3
Main Authors: Wan, Guo Chun, Liu, Wen Jing, Xia, Zi Wei, Tong, Mei Song
Format: Journal Article
Language:English
Published: Bognor Regis Wiley Subscription Services, Inc 01.05.2019
Subjects:
Algorithms
Codes
Coding
Consumer goods
Data recovery
Decoding
encoding and decoding
information‐grayscale matrix
Logistics
Product information
product tracing
Structural damage
ISSN:0894-3370, 1099-1204
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper proposes a compounded encoding and decoding algorithm based on the information‐grayscale matrix. Generally, it is very difficult to track the original information in the circulation of commodity. This algorithm is aimed to be applied to product tracing, especially fast‐moving consumer goods (FMCG). According to the traceability requirements of product information, we construct the structure of basic information code with information bits and check bits. The encoded information can be mapped into an information matrix through visible and invisible processes after extending the matrix, and we generate the corresponding grayscale matrix by calculating the relationship between the four‐dimensional matrices of each matrix cell. It is the information‐grayscale matrix that forms our product traceability information matrix. When the matrix is damaged in logistics transportation, we can get very high matrix information recovery rate through the decoding algorithm of the information‐grayscale matrix including self‐recovery, cross recovery, mutual recovery, and iteration; finally, the 2 × DA + DC structure can obtain 85% recovery rate when the damage rate reaches 70% for 10 million data volumes, and it can be extended into various structures. In addition, the algorithm can achieve a good balance between encoding rate and recovery rate and can be extended into different structures.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0894-3370
1099-1204
DOI:10.1002/jnm.2543