CN112907259A - Non-unique identification code for commodity management - Google Patents

Non-unique identification code for commodity management Download PDF

Info

Publication number
CN112907259A
CN112907259A CN202110157386.7A CN202110157386A CN112907259A CN 112907259 A CN112907259 A CN 112907259A CN 202110157386 A CN202110157386 A CN 202110157386A CN 112907259 A CN112907259 A CN 112907259A
Authority
CN
China
Prior art keywords
code
total number
identification codes
encryption
identification
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202110157386.7A
Other languages
Chinese (zh)
Inventor
朱宏宽
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Wuxi Yimaide Technology Co ltd
Original Assignee
Wuxi Yimaide Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Wuxi Yimaide Technology Co ltd filed Critical Wuxi Yimaide Technology Co ltd
Priority to CN202110157386.7A priority Critical patent/CN112907259A/en
Publication of CN112907259A publication Critical patent/CN112907259A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/018—Certifying business or products
    • G06Q30/0185—Product, service or business identity fraud
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/70—Type of the data to be coded, other than image and sound
    • H03M7/705—Unicode

Landscapes

  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Engineering & Computer Science (AREA)
  • Marketing (AREA)
  • Economics (AREA)
  • Finance (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Accounting & Taxation (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention relates to a non-unique identification code for commodity management, which comprises 8 fields, namely: the system comprises a manufacturer code, a batch number, a type number, a collection code, a sequence number, a total number, an encryption code and a reserved bit. The invention has the advantages that: 1) the identification code can be used as an important means for strictly managing, tracing and recovering code-free products, and can prevent data from being forged; 2) the identification code can be used for carrying out information management on a code-free product, can carry out partial tracing, and effectively avoids channel conflict and water cargo; 3) compared with one-object-one-code, the method has the advantages that the use cost is reduced, and the management is enhanced while the activity does not fail.

Description

Non-unique identification code for commodity management
Technical Field
The invention relates to a non-unique identification code for commodity management, belonging to the technical field of information.
Background
In a common commodity supply chain, a coding mode is added to perform informatization management on commodities. The code is a string of characters or numbers, and the characters or numbers can be secondarily coded into a graphic code such as a bar code or a two-dimensional code which can be directly recognized by a code scanning device. And then the graphic code is pasted on the commodity or the outer package thereof for convenient management.
In the prior art, for some high-value or special-supervision-required commodities, management is generally performed in an article-to-code manner, so that accurate tracing can be performed (hereinafter, such commodities are referred to as code commodities). For the commodities with medium and low values or without supervision requirements, the commodities can be managed according to models or batches due to cost factors, and generally the commodities can not be managed one by one (hereinafter, the commodities are called as code-free commodities); this type of product is generally managed only quantitatively. In practice, we find that for uncoded commodities, due to the lack of corresponding codes and the presence of some management inconveniences, we still want to perform some limited information management on the uncoded commodities, such as tracking the manufacturers, batches, models, quantities, production dates, and the like of the commodities, and simultaneously preventing the phenomenon of channel conflict and water cargo existing in the supply chain and reducing the risk of supply chain management (compared with the coded commodities, the uncoded commodities are more prone to the phenomenon of channel conflict and water cargo).
In summary, in the prior art, the product code is encoded for one object and one code at a high cost, although the information management manner for one object and one code is precise, the management cost is high, and not all the products need to be managed for one object and one code; or the code only carries the most basic information of the commodity, and the water cargo and the channel conflict in the supply chain cannot be prevented.
Disclosure of Invention
The invention provides a non-unique identification code for commodity management, which aims to overcome the defects in the prior art, and manages codeless commodities by a simple, feasible and low-cost code, wherein the code is not in one-to-one correspondence with the commodities but carries some key information of the commodities, thereby facilitating the circulation management of the commodities and effectively preventing the phenomena of goods fleeing and water delivery in the commodity circulation.
The technical solution of the invention is as follows: a non-unique identification code for merchandise management comprising 8 fields, namely: manufacturer code, batch number, type number, aggregate code, sequence number, total number, encryption code and reserved bit, wherein:
the manufacturer code is a code representing a manufacturer,
the batch number is a code representing a production batch number,
the type number is a code representing the type of the commodity,
the set code is a unique ID of a set to which the encrypted identification code belongs,
the serial number is used for modifying any number not exceeding the total number when two identical identification codes are bound on two different commodities so that the two identical identification codes are changed into two different identification codes,
the total number is the total number of the identification codes in the set to which the encrypted identification code belongs,
the encryption code is used for encrypting the set code and the total number code, the set code plaintext is obtained by decryption according to the encryption code and the set code, the total number code plaintext is obtained by decryption according to the encryption code and the total number code,
the reserved bits are reserved for expansion.
Preferably, each of the 8 fields is 32-bit fixed length code.
Preferably, the system comprises an encoder module, a decoder module and a collision check module, wherein:
the encoder module is used for inputting a manufacturer code, a batch number, a type number, a set code, a sequence number, a total number, an encryption code and a reserved bit and outputting a code of 32 × 8 ═ 256 bits;
the decoder module is used for inputting a code of 32 × 8 ═ 256 bits and outputting a manufacturer code, a batch number, a type number, a set code, a sequence number, a total number, an encryption code and a reserved bit;
the conflict checking module is used for inputting a group of identification codes with the same set code and total number and outputting the number of invalid identification codes, namely the number of the identification codes-the number of the total number; or inputting a group of identification codes with the same set code and outputting the least number of invalid identification codes, namely assuming that the identification codes with the most number and the consistent set code and total number code are valid identification codes, and the rest are invalid identification codes.
The invention has the advantages that: 1) the identification code (token) of the invention can be used as an important means for strictly managing, tracing and recovering codeless products, and can prevent data from being faked;
2) the identification code can be used for carrying out information management on a code-free product, can carry out partial tracing, and effectively avoids channel conflict and water cargo;
3) compared with one-object-one-code, the method has the advantages that the use cost is reduced, and the management is enhanced while the activity does not fail.
Drawings
Fig. 1 is a schematic view of the design of codes of non-unique identification codes for commodity management in the invention.
Detailed Description
The present invention will be described in further detail with reference to examples and specific embodiments.
As shown in fig. 1, a non-unique identification code (which may be called a token) for merchandise management includes 8 fields, namely: manufacturer code, batch number, type number, aggregate code, sequence number, total number, encryption code and reserved bit, wherein:
the manufacturer code is a code representing a manufacturer,
the batch number is a code representing a production batch number,
the type number is a code representing the type of the commodity,
the set code is the unique ID (after encryption) of the set to which the identification code belongs,
the serial number is used for modifying any number not exceeding the total number when two identical identification codes are bound on two different commodities so that the two identical identification codes are changed into two different identification codes,
the total number is the total number of the identification codes in the set to which the identification code belongs (after encryption),
the encryption code is used for encrypting the set code and the total number code, the decryption function f (the function f is defined by the function requirement) can decrypt to obtain the set code plaintext according to the encryption code and the set code, the decryption function f can decrypt to obtain the total number code plaintext according to the encryption code and the total number code,
the reserved bits are reserved for expansion.
The 8 fields are 32 bits (can store within 4 positive integers of 255 or 4 ASCII characters) respectively, and all the fields are coded in a fixed length mode. This allows the encoding and decoding process to be simplified to the maximum extent, although there may be some redundancy.
The identification code (token) designed according to the above fields has the following functions:
1) the set code and the total number code in the token are fields which are mainly protected, if the set codes of the two tokens are the same and the total number codes are different, one token is necessary to be wrong;
2) the serial number can be flexibly modified such that if two identical tokens are bound to two different items, the information system can change the two identical tokens into two different tokens by modifying the serial number to any number that does not exceed the total number.
3) In a group of tokens which have the same set code and total number but different sequence numbers, and are considered to correspond to different commodities, if the total number of tokens exceeds the total number, the exceeding part is an error token.
A processing system for non-unique identification codes for merchandise management, comprising an encoder module, a decoder module, and a conflict check module, wherein:
the encoder module is used for inputting a manufacturer code, a batch number, a type number, a set code, a sequence number, a total number, an encryption code and a reserved bit and outputting a code of 32 × 8 ═ 256 bits;
the decoder module is used for inputting a code of 32 × 8 ═ 256 bits and outputting a manufacturer code, a batch number, a type number, a set code, a sequence number, a total number, an encryption code and a reserved bit;
the conflict checking module is used for inputting a group of identification codes (tokens) with the same set code and total number and outputting the number of invalid identification codes (namely the number of the identification codes-the number of the total number), or is used for inputting a group of identification codes with the same set code and outputting the number of the least invalid identification codes (assuming that the identification codes with the maximum number and consistent set codes and total number codes are valid identification codes, and the rest are invalid identification codes).
When the system is used specifically, the non-unique identification code for commodity management is called a token, and the most important characteristic is that a group of tokens corresponds to a group of commodities and represents the mapping relation from a set to a set. Assume first that there are two sets of tokens and two sets of goods, as shown below, the set of tokens { C1,C2,...CMMapping to a set of items P1,P2,...,PMThe total number of M tokens, M commodities and a token set { X }1,X2,...XNMapping to a set of items Y1,Y2,...YNN tokens are total, and N commodities are total.
{C1,C2,...CM}→{P1,P2,...,PM}
{X1,X2,...XN}→{Y1,Y2,...YN}
Each commodity carries a token as an identity certificate, but the tokens do not correspond to the commodities one to one, the tokens and a group to which the commodities belong have a corresponding relationship, how many commodities in the group have how many tokens, and a single token carries information of how many tokens in the same group. For convenience in explaining the principles of token design, reference may be made specifically to the following embodiments:
example 1
And (4) preventing tampering.
Dealer A's warehouse has goods { P }1,P2,...,PM}. In a conventional system without tokens, only the number of items M is recorded. If an operator has the right to operate the database, M may be changed to M1, which will be difficult to find and recover in subsequent transactions. If a token system is employed, then dealer A holds M tokens { C ] in the information system at the same time1,C2,...CM}. If the operator needs to increase the number, the token C must be increasedM+1,CM+2,...CM1Will record the added tokens and the circulation of tokens in the system, facilitating the recovery to the pre-modification situation. And vice versa it can be known where the reduced tokens go out.
Example 2
And (4) tracing reference.
Dealer A's warehouse has goods { P }1,P2,...,PMAnd meanwhile, a distributor A in the information system holds M tokens { C }1,C2,...CM}. For product PMTracing information of (1), CMThe flow record may be PMReference route to (2) retrospective.
Example 3
And (6) changing goods.
Dealer A's warehouse has goods { P }1,P2,...,PMAnd meanwhile, a distributor A in the information system holds M tokens { C }1,C2,...CM}. The dealer a puts the article P1(token is C1) Sold to customer B, customer pair P1Unsatisfactorily requiring a change of goods, whereupon the dealer retrieves P1And to load the cargo P2(token is C2) And handed over to client B.
If the code is one-object-one-code, the following processes must be recorded in the information system: a → (C)1)→B,A←(C1)←B，A→(C2) → B. Wherein A → (C)1) → B represents A to deliver the cargo P1Is delivered out of warehouse to B (C)1Is P1The corresponding code in the information system).
If a token is employed, the information system need only record A → (C)1) → B because the token is a set correspondence, token C1Can refer to any one of a collection of items, namely C1Can refer to a commodity P1May also refer to a commodity P2. The specific operation of changing goods can be completed only by offline without recording by an information system. This reduces the requirements for information recording and also reduces the actual operating costs.
Example 4
And (4) channel conflict.
The manufacturer produces two batches of goods, one batch being { P }1,P2,...,PMAppointing to sell goods and tokens thereof in K province, and manufacturers sell goods and tokens thereof { C }1,C2,...CMGive to dealer A of K provinceK(ii) a One lot is { Y1,Y2,...YNAppointing to sell goods and tokens thereof in G province, and manufacturers can sell goods and tokens thereof { X }1,X2,...XNGive to dealer A of province GG. Due to different market competition environments, the delivery price of K province is lower than that of G province, and manufacturers do not allow goods fleeing sale, namely, do not allow goods fleeing saleAnd selling the commodities distributed to the province K to the customers of the province G.
If only quantity management is carried out on the uncoded products, the channel conflict sale is difficult to avoid in actual operation. This problem can be solved if the token is used for administration, dealer AKThe sold commodity can only be carried { C1,C2,...CMThe token in (1), distributor AGThe goods sold can only carry { X }1,X2,...XNThe token in (c), which eliminates the possibility of a channel conflict by the dealer.
Although in practice it is still possible for the goods to come from distributor aKFlow to dealer AGBut in general AKIs unlikely to exceed M pieces, AGIs unlikely to exceed N pieces. This both prevents channel conflict and retains the flexibility that cross-regional dealers can cooperate with each other.
Example 5
And (5) water cargo.
Water cargo refers to goods that enter the local market from smuggling channels. The water goods may be pretended to be sold as genuine goods, but the tokens must be carried, and the tokens and the genuine goods are equal in number, so that the genuine goods cannot be sold with the tokens.
The modules described above are prior art, and those skilled in the art may use any model and existing design that can implement their corresponding functions.
The foregoing is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, various changes and modifications can be made without departing from the inventive concept of the present invention, and these changes and modifications are all within the scope of the present invention.

Claims (3)

1. A non-unique identification code for merchandise management, characterized by comprising 8 fields, namely: manufacturer code, batch number, type number, aggregate code, sequence number, total number, encryption code and reserved bit, wherein:
the manufacturer code is a code representing a manufacturer,
the batch number is a code representing a production batch number,
the type number is a code representing the type of the commodity,
the set code is a unique ID of a set to which the encrypted identification code belongs,
the serial number is used for modifying any number not exceeding the total number when two identical identification codes are bound on two different commodities so that the two identical identification codes are changed into two different identification codes,
the total number is the total number of the identification codes in the set to which the encrypted identification code belongs,
the encryption code is used for encrypting the set code and the total number code, the set code plaintext is obtained by decryption according to the encryption code and the set code, the total number code plaintext is obtained by decryption according to the encryption code and the total number code,
the reserved bits are reserved for expansion.
2. A non-unique identification code for merchandise management as claimed in claim 1 wherein each of said 8 fields is 32bit fixed length code.
3. The system of claim 2, comprising an encoder module, a decoder module and a collision check module, wherein:
the encoder module is used for inputting a manufacturer code, a batch number, a type number, a set code, a sequence number, a total number, an encryption code and a reserved bit and outputting a code of 32 × 8 ═ 256 bits;
the decoder module is used for inputting a code of 32 × 8 ═ 256 bits and outputting a manufacturer code, a batch number, a type number, a set code, a sequence number, a total number, an encryption code and a reserved bit;
the conflict checking module is used for inputting a group of identification codes with the same set code and total number and outputting the number of invalid identification codes, namely the number of the identification codes-the number of the total number; or inputting a group of identification codes with the same set code and outputting the least number of invalid identification codes, namely assuming that the identification codes with the most number and the consistent set code and total number code are valid identification codes, and the rest are invalid identification codes.
CN202110157386.7A 2021-02-04 2021-02-04 Non-unique identification code for commodity management Pending CN112907259A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110157386.7A CN112907259A (en) 2021-02-04 2021-02-04 Non-unique identification code for commodity management

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110157386.7A CN112907259A (en) 2021-02-04 2021-02-04 Non-unique identification code for commodity management

Publications (1)

Publication Number Publication Date
CN112907259A true CN112907259A (en) 2021-06-04

Family

ID=76122521

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110157386.7A Pending CN112907259A (en) 2021-02-04 2021-02-04 Non-unique identification code for commodity management

Country Status (1)

Country Link
CN (1) CN112907259A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100172502A1 (en) * 2007-01-09 2010-07-08 Christopher Richard Jones Systems and methods for secure supply chain management and inventory control
CN103854185A (en) * 2012-11-30 2014-06-11 上海透云物联网科技有限公司 QR code, anti-counterfeiting code, RFID tag and mobile application combined anti-counterfeiting system
CN108229891A (en) * 2018-02-07 2018-06-29 徐颂 Supply chain data acquisition and verification method and system compatible with standard article codes
CN109858920A (en) * 2017-11-29 2019-06-07 山西百伦信息科技有限公司 A kind of random multi-code certification is traced to the source anti-fake method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100172502A1 (en) * 2007-01-09 2010-07-08 Christopher Richard Jones Systems and methods for secure supply chain management and inventory control
CN103854185A (en) * 2012-11-30 2014-06-11 上海透云物联网科技有限公司 QR code, anti-counterfeiting code, RFID tag and mobile application combined anti-counterfeiting system
CN109858920A (en) * 2017-11-29 2019-06-07 山西百伦信息科技有限公司 A kind of random multi-code certification is traced to the source anti-fake method
CN108229891A (en) * 2018-02-07 2018-06-29 徐颂 Supply chain data acquisition and verification method and system compatible with standard article codes

Similar Documents

Publication Publication Date Title
US20200265446A1 (en) Food chain product label and method of use, and food trust identifier system
CN109993546B (en) Medicine tracing system based on RFID and blockchain and implementation method
US11144863B2 (en) Method and apparatus for identifying, authenticating, tracking and tracing manufactured items
US5768384A (en) System for identifying authenticating and tracking manufactured articles
CN101847225B (en) A kind of method based on CN39 code managing commodity circulation
US20070205258A1 (en) System and Method of Product Information Coding and Authentication
CN107430755A (en) The encrypted authentication in source in supply chain
CN106447362B (en) Method and device for preventing counterfeit and shoddy commodities from entering circulation field
CN105469132A (en) Duplicate coding internet of things traceability security label and 2-dimensional bar code security traceability method
CN102609803A (en) Two-dimension code based low-cost product safety tracking system and method thereof
CN105427117A (en) Universal traceable anti-fake system of agricultural products based on electronic data preservation technology and method of same
CN101593265A (en) Antiforge system based on radio-frequency (RF) identification
CN111639729B (en) RFID and blockchain-based anti-counterfeiting tracing method
CN110910150B (en) Correlation method and device for tracing source based on Internet of things technology and combined block chain
CN103136645A (en) Method for achieving information interaction with only information carrier in product full life cycle
CN112381554A (en) Standard package traceability code generation system and method
CN102194190A (en) Method for trace information architecture
CN111242638A (en) Commodity anti-counterfeiting traceability strategy method based on RFID technology and hierarchical management
CN111461737A (en) Product source tracing anti-counterfeiting and anti-channel conflict method based on block chain
CN112907259A (en) Non-unique identification code for commodity management
CN106779751A (en) A kind of Food Logistics supply chain system and method based on UHF RFID
CN106485508A (en) Commodity fidelity implementation method and fidelity merchandise sales management system
CN109801083A (en) A kind of tobacco retail two dimensional code is traced to the source marketing system and method
CN113298534A (en) Code scanning terminal and code scanning method
CN115082087A (en) Food safety traceability system based on block chain and big data

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination