CN109409460A - A method of list data is transmitted using two dimensional code - Google Patents

A method of list data is transmitted using two dimensional code Download PDF

Info

Publication number
CN109409460A
CN109409460A CN201811241031.0A CN201811241031A CN109409460A CN 109409460 A CN109409460 A CN 109409460A CN 201811241031 A CN201811241031 A CN 201811241031A CN 109409460 A CN109409460 A CN 109409460A
Authority
CN
China
Prior art keywords
dimensional code
data
subinterval
probability
symbol
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
CN201811241031.0A
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.)
Jiangsu Tax Soft Software Technology Co Ltd
Original Assignee
Jiangsu Tax Soft Software 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 Jiangsu Tax Soft Software Technology Co Ltd filed Critical Jiangsu Tax Soft Software Technology Co Ltd
Priority to CN201811241031.0A priority Critical patent/CN109409460A/en
Publication of CN109409460A publication Critical patent/CN109409460A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06KGRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K17/00Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00Conversion 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/30Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code

Abstract

The invention discloses a kind of methods using two dimensional code transmission list data, belong to field of data transmission, include the following steps: the unit information for removing blank in table;The identical cell of data in table is merged, a numerical value is only recorded, other cells only record line information;Lossless compression is carried out to initial data;Generate two dimensional code;The two dimensional code generated using two-dimensional code scanning tool scans;It is decoded to obtain the data in two dimensional code to the two dimensional code of scanning.Unit information of the present invention blank in list data removal table, the identical cell of data in table is merged, only record a numerical value, other cells only record line information, carry out lossless compression to initial data, generate two dimensional code, the two dimensional code generated using two-dimensional code scanning tool scans, it is decoded to obtain the data in two dimensional code to the two dimensional code of scanning, changes existing data transfer mode, keep data transmission more convenient.

Description

A method of list data is transmitted using two dimensional code
Technical field
The present invention relates to a kind of methods for transmitting list data, transmit list data using two dimensional code more particularly to a kind of Method, belong to field of data transmission.
Background technique
In the daily work, it is often necessary to form document is transmitted between different devices, but many times, due to hard The limitation of part condition or network problem, can not establish physical connection between different devices, cause file that can not transmit, with Smart phone it is universal, two dimensional code is widely used, and by planar bar code technology, the data of form document may be implemented Transmission, the big feature of the one of list data is format specification, and the data of each cell correspond to fixed columns and rows, so It only needs cell data and line information to be recorded and are stored in two dimensional code, then is scanned the two-dimensional code with smart machine and be can be obtained pair The data answered.
Summary of the invention
The main object of the present invention is to provide for a kind of method using two dimensional code transmission list data, utilizes two dimensional code The transmission for realizing data, changes existing data transfer mode, keeps data transmission more convenient.
The purpose of the present invention can reach by using following technical solution:
A method of list data is transmitted using two dimensional code, which comprises the steps of:
Step 1: the unit information of blank in removal table;
Step 2: the identical cell of data in table being merged, a numerical value is only recorded, other cells are only remembered Record line information;
Step 3: lossless compression is carried out to initial data;
Step 4: generating two dimensional code;
Step 5;The two dimensional code generated using two-dimensional code scanning tool scans;
Step 6: being decoded to obtain the data in two dimensional code to the two dimensional code of scanning.
Further, lossless compression mode programs in step 3 for Huffman encoding mode or arithmetic, and the lossless pressure of step 3 Contracting can repeatedly be compressed.
Further, Huffman encoding is forced coding, and its step are as follows;
Step 21: source symbol is pressed into probability descending order;
Step 22: two the smallest probability being added up, the probability as new symbol;
Step 23: above-mentioned two step is repeated, until the sum of probability reaches 1;
Step 24: when merging message every time, assigning the message being merged to 1 and 0 or imparting 0 and 1;
Step 25: finding from each source symbol to probability for 1 road and pass through, record road through upper 1 and 0;
Step 26: each symbol is write out from the root of code tree to destination node 1,0 sequence.
Further, arithmetic coding is a kind of binary coding, and this coding method is the case where not considering information source statistics Under, as long as monitoring the frequency that a bit of time inner code word occurs, regardless of statistics is stable or non-stationary, the code rate of coding is total Can level off to information source entropy, the encryption algorithm of each iteration only handles a data symbol, and only arithmetical operation, to two into For system coding, there are two source symbols.
Further, in the primary stage of arithmetic coding, maximum probability Pe and small probability Qe can be set, then to encoded Bitstream symbol is judged that its step are as follows:
Step 31: setting coding initialization subinterval as [0,1], Qe is counted from 0, then Pe=1-Qe;
Step 32: determining subinterval initial position: subinterval initial position=preceding subinterval length+current sign area Between the preceding subinterval length of left end X;
Step 33: determining new subinterval length: the probability of new subinterval length=preceding subinterval length X current sign;
Step 34: with the input of data symbol stream encoded, subinterval is gradually reduced;
Step 35: digit needed for the subinterval length finally obtained determines a certain number indicated in the region.
Further, step 4, which can be split data, generates multiple two dimensional codes.
Further, the two dimensional code that step 4 generates can be reserved for as picture.
Advantageous effects of the invention:
Method using two dimensional code transmission list data of the invention believes the unit of blank in list data removal table Breath, merges the identical cell of data in table, only records a numerical value, other cells only record line information, Lossless compression is carried out to initial data, generates two dimensional code, the two dimensional code generated using two-dimensional code scanning tool scans, to scanning Two dimensional code is decoded to obtain the data in two dimensional code, changes existing data transfer mode, keeps data transmission more convenient.
Detailed description of the invention
Fig. 1 is a preferred embodiment schematic diagram of the method according to the invention that list data is transmitted using two dimensional code;
Specific embodiment
To make the more clear and clear technical solution of the present invention of those skilled in the art, below with reference to examples and drawings The present invention is described in further detail, and embodiments of the present invention are not limited thereto.
As shown in Figure 1, the method provided in this embodiment using two dimensional code transmission list data, includes the following steps:
Step 1: the unit information of blank in removal table;
Step 2: the identical cell of data in table being merged, a numerical value is only recorded, other cells are only remembered Record line information;
Data record format are as follows: cell identifies 1 cell mark 2 ... | cell data.
Such as the data in A1, B2 cell are " aabb ", then data record are as follows:
" A1B2 | aabb " uses comma as separator between every data record.
Step 3: lossless compression is carried out to initial data;
Step 4: generating two dimensional code;
Step 5;The two dimensional code generated using two-dimensional code scanning tool scans;
Step 6: being decoded to obtain the data in two dimensional code to the two dimensional code of scanning.
In the present embodiment, as shown in Figure 1, lossless compression mode is that Huffman encoding mode or arithmetic program in step 3, And step 3 lossless compression can repeatedly compress.
In the present embodiment, as shown in Figure 1, Huffman encoding is forced coding, its step are as follows;
Step 21: source symbol is pressed into probability descending order;
Step 22: two the smallest probability being added up, the probability as new symbol;
Step 23: above-mentioned two step is repeated, until the sum of probability reaches 1;
Step 24: when merging message every time, assigning the message being merged to 1 and 0 or imparting 0 and 1;
Step 25: finding from each source symbol to probability for 1 road and pass through, record road through upper 1 and 0;
Step 26: each symbol is write out from the root of code tree to destination node 1,0 sequence.
In the present embodiment, as shown in Figure 1, arithmetic coding is a kind of binary coding, this coding method is not consider In the case that information source counts, as long as monitoring the frequency that a bit of time inner code word occurs, regardless of statistics is stable or non-stationary , the code rate of coding can level off to information source entropy, and the encryption algorithm of each iteration only handles a data symbol, and only Arithmetical operation, for binary coding, there are two source symbols.In the primary stage of arithmetic coding, one can be set probably Rate Pe and small probability Qe, then judges that its step are as follows to bitstream symbol encoded:
Step 31: setting coding initialization subinterval as [0,1], Qe is counted from 0, then Pe=1-Qe;
Step 32: determining subinterval initial position: subinterval initial position=preceding subinterval length+current sign area Between the preceding subinterval length of left end X;
Step 33: determining new subinterval length: the probability of new subinterval length=preceding subinterval length X current sign;
Step 34: with the input of data symbol stream encoded, subinterval is gradually reduced;
Step 35: digit needed for the subinterval length finally obtained determines a certain number indicated in the region.
In the present embodiment, as shown in Figure 1, step 4, which can be split data, generates multiple two dimensional codes.
In the present embodiment, as shown in Figure 1, the two dimensional code that step 4 generates can be reserved for as picture.
To sum up, in the present embodiment, identical to data in table the unit information of blank in list data removal table Cell merge, only record a numerical value, other cells only record line information, carry out lossless pressure to initial data Contracting generates two dimensional code, the two dimensional code generated using two-dimensional code scanning tool scans.The two dimensional code of scanning is decoded to obtain two The data in code are tieed up, existing data transfer mode is changed, keep data transmission more convenient.
More than, further embodiment only of the present invention, but scope of protection of the present invention is not limited thereto, and it is any to be familiar with Within the scope of the present disclosure, according to the technique and scheme of the present invention and its design is subject to those skilled in the art With replacement or change, belongs to protection scope of the present invention.

Claims (7)

1. a kind of method using two dimensional code transmission list data, which comprises the steps of:
Step 1: the unit information of blank in removal table;
Step 2: the identical cell of data in table being merged, a numerical value is only recorded, other cells only record row Column information;
Step 3: lossless compression is carried out to initial data;
Step 4: generating two dimensional code;
Step 5;The two dimensional code generated using two-dimensional code scanning tool scans;
Step 6: being decoded to obtain the data in two dimensional code to the two dimensional code of scanning.
2. a kind of method using two dimensional code transmission list data according to claim 1, which is characterized in that in step 3 Lossless compression mode is that Huffman encoding mode or arithmetic program, and step 3 lossless compression can repeatedly compress.
3. a kind of method using two dimensional code transmission list data according to claim 2, which is characterized in that Huffman is compiled Code is forced coding, and its step are as follows;
Step 21: source symbol is pressed into probability descending order;
Step 22: two the smallest probability being added up, the probability as new symbol;
Step 23: above-mentioned two step is repeated, until the sum of probability reaches 1;
Step 24: when merging message every time, assigning the message being merged to 1 and 0 or imparting 0 and 1;
Step 25: finding from each source symbol to probability for 1 road and pass through, record road through upper 1 and 0;
Step 26: each symbol is write out from the root of code tree to destination node 1,0 sequence.
4. a kind of method using two dimensional code transmission list data according to claim 2, which is characterized in that arithmetic coding It is a kind of binary coding, this coding method is in the case where not considering information source statistics, as long as monitoring a bit of time Internal Code The frequency that word occurs, regardless of statistics is stable or non-stationary, the code rate of coding can level off to information source entropy, each iteration Encryption algorithm only handle a data symbol, and only arithmetical operation, for binary coding, source symbol only has two It is a.
5. a kind of method using two dimensional code transmission list data according to claim 4, which is characterized in that compiled in arithmetic The primary stage of code, maximum probability Pe and small probability Qe can be set, then bitstream symbol encoded is judged, step It is as follows:
Step 31: setting coding initialization subinterval as [0,1], Qe is counted from 0, then Pe=1-Qe;
Step 32: determine subinterval initial position: subinterval initial position=preceding subinterval length+current sign section is left Hold the preceding subinterval length of X;
Step 33: determining new subinterval length: the probability of new subinterval length=preceding subinterval length X current sign;
Step 34: with the input of data symbol stream encoded, subinterval is gradually reduced;
Step 35: digit needed for the subinterval length finally obtained determines a certain number indicated in the region.
6. a kind of method using two dimensional code transmission list data according to claim 1, which is characterized in that step 4 can Data are split and generate multiple two dimensional codes.
7. a kind of method using two dimensional code transmission list data according to claim 1, which is characterized in that step 4 is raw At two dimensional code can be reserved for as picture.
CN201811241031.0A 2018-10-24 2018-10-24 A method of list data is transmitted using two dimensional code Pending CN109409460A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811241031.0A CN109409460A (en) 2018-10-24 2018-10-24 A method of list data is transmitted using two dimensional code

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811241031.0A CN109409460A (en) 2018-10-24 2018-10-24 A method of list data is transmitted using two dimensional code

Publications (1)

Publication Number Publication Date
CN109409460A true CN109409460A (en) 2019-03-01

Family

ID=65469473

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811241031.0A Pending CN109409460A (en) 2018-10-24 2018-10-24 A method of list data is transmitted using two dimensional code

Country Status (1)

Country Link
CN (1) CN109409460A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110011993A (en) * 2019-03-25 2019-07-12 浩云科技股份有限公司 A kind of two dimensional code big data safe transmission device based on dynamic multi-level encryption and decryption

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101206707A (en) * 2006-12-21 2008-06-25 佳能株式会社 Form editing apparatus, control method, and storage medium
CN103177281A (en) * 2013-04-12 2013-06-26 江苏圆坤二维码研究院有限公司 Two-dimensional code compiling method
CN104899630A (en) * 2015-06-18 2015-09-09 桂林电子科技大学 Method of encoding/decoding color QR code
CN105550727A (en) * 2015-12-22 2016-05-04 艾体威尔电子技术(北京)有限公司 Method for making electronic receipts by using two-dimensional technology

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101206707A (en) * 2006-12-21 2008-06-25 佳能株式会社 Form editing apparatus, control method, and storage medium
CN103177281A (en) * 2013-04-12 2013-06-26 江苏圆坤二维码研究院有限公司 Two-dimensional code compiling method
CN104899630A (en) * 2015-06-18 2015-09-09 桂林电子科技大学 Method of encoding/decoding color QR code
CN105550727A (en) * 2015-12-22 2016-05-04 艾体威尔电子技术(北京)有限公司 Method for making electronic receipts by using two-dimensional technology

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
陈明: "《多媒体技术基础》", 30 June 2000, 中央广播电视大学出版社 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110011993A (en) * 2019-03-25 2019-07-12 浩云科技股份有限公司 A kind of two dimensional code big data safe transmission device based on dynamic multi-level encryption and decryption
CN110011993B (en) * 2019-03-25 2021-07-27 浩云科技股份有限公司 Two-dimensional code big data safety transmission device based on developments multistage encryption and decryption

Similar Documents

Publication Publication Date Title
CN110603595B (en) Methods and systems for reconstructing genomic reference sequences from compressed genomic sequence reads
CN100553152C (en) Coding method and equipment and coding/decoding method and equipment based on CABAC
US7990289B2 (en) Combinatorial coding/decoding for electrical computers and digital data processing systems
US20130114893A1 (en) Image Compression Using Sub-Resolution Images
CN110505218B (en) Grid data self-adaptive compression transmission method based on JSON and computer storage medium
CN115085924B (en) Computer information transmission encryption system based on Huffman coding
CN102438145A (en) Image lossless compression method on basis of Huffman code
CN110021369B (en) Gene sequencing data compression and decompression method, system and computer readable medium
WO2019076177A1 (en) Gene sequencing data compression preprocessing, compression and decompression method, system, and computer-readable medium
CN115529357B (en) Updating abnormity matching method based on MES intercommunication interconnection production data
CN101917352B (en) Method for recognizing picture spam mails and system thereof
CN112152634B (en) Block compression encoding method, device, computer equipment and readable storage medium
CN109409460A (en) A method of list data is transmitted using two dimensional code
CN107565975A (en) The method of FASTQ formatted file Lossless Compressions
CN110021368B (en) Comparison type gene sequencing data compression method, system and computer readable medium
Rifà-Pous et al. Product perfect codes and steganography
CN115632661B (en) Efficient compression transmission method for network security information
CN103178968A (en) Encryption method of data transmission threshold scheme based on Huffman compression
CN103927572A (en) Encoding graph block and method and device for forming lattice graph through encoding graph block
CN112506876B (en) Lossless compression query method supporting SQL query
CN109698703A (en) Gene sequencing data decompression method, system and computer-readable medium
CN101352015A (en) Transmission of handwriting over SMS protocol
JP6005273B2 (en) Data stream encoding method, transmission method, transmission method, encoding device for encoding data stream, transmission device, and transmission device
CN109698702B (en) Gene sequencing data compression preprocessing method, system and computer readable medium
KR100597004B1 (en) The apparatus for processing of the binary image using the reassignment of the symbol dictionary and the method thereof

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
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20190301