CN115118417B - Erasing and decoding configuration method and device of polarization code in information coordination - Google Patents

Erasing and decoding configuration method and device of polarization code in information coordination Download PDF

Info

Publication number
CN115118417B
CN115118417B CN202210731417.XA CN202210731417A CN115118417B CN 115118417 B CN115118417 B CN 115118417B CN 202210731417 A CN202210731417 A CN 202210731417A CN 115118417 B CN115118417 B CN 115118417B
Authority
CN
China
Prior art keywords
vector
communication
decoding
frozen
key
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.)
Active
Application number
CN202210731417.XA
Other languages
Chinese (zh)
Other versions
CN115118417A (en
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.)
National University of Defense Technology
Original Assignee
National University of Defense Technology
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 National University of Defense Technology filed Critical National University of Defense Technology
Priority to CN202210731417.XA priority Critical patent/CN115118417B/en
Publication of CN115118417A publication Critical patent/CN115118417A/en
Application granted granted Critical
Publication of CN115118417B publication Critical patent/CN115118417B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0852—Quantum cryptography
    • H04L9/0858—Details about key distillation or coding, e.g. reconciliation, error correction, privacy amplification, polarisation coding or phase coding
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0819—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0852—Quantum cryptography
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention discloses an erasure decoding configuration method and device for polarization codes in information coordination. The method comprises the following steps: the communication party encodes the screened secret key, extracts the check bit of the encoded vector according to the frozen vector and sends the check bit to the other party, the communication other party constructs the check vector according to the frozen vector and the check bit and encodes the check vector, the code word and the screened secret key are exclusive-or to generate a decoding vector, the decoding vector is decoded, and the two communication parties respectively generate consistent coordinated secret keys. The invention does not need participation of true random numbers, and the frozen bit in the decoding process is a preset fixed value, so that the existing high-speed decoder of the polarization code is supported, and the throughput rate of the information coordination process is improved.

Description

Erasing and decoding configuration method and device of polarization code in information coordination
Technical Field
The invention relates to the technical field of quantum key distribution, in particular to an erasure decoding configuration method and device for polarization codes in information coordination.
Background
The quantum key distribution can generate information theory safe keys for two communication parties so as to ensure unconditional safe communication among users. In an actual quantum key distribution system, imperfections in the device and environment can lead to errors in the screened key generated by both parties of communication. And the information coordination transmits check information through a classical channel, and bit information of error codes of the two parties is coordinated to be consistent, so that the consistency of the secret key is ensured. The existing information coordination can be applied to various fields such as physical layer security key distribution, physical unclonable equations, bit reconciliation and the like.
In information coordination, the verification information transmitted by both communication parties leaks the information amount of the key, thereby reducing the key rate. The polarization code-based information coordination scheme has the potential to approach the aromatic limit to help the quantum key distribution system reach the theoretical limit. The existing configuration method of the polarization code in information coordination is mainly two methods: a direct decoding configuration method and a bit inversion decoding configuration method. In the direct decoding configuration method, a communication party (Alice) encodes a key with an error code and sends frozen bits in a codeword to another party (Bob); and Bob directly decodes the screened secret key according to the received frozen bit, thereby realizing correction of error bits. However, in the direct decoding configuration method, the frozen bit in the decoding process is not a fixed value, and is determined by the filtered key at Alice end, and cannot support the high-speed decoder of the current polarization code. In the bit inversion decoding configuration method, alice fills information bits with true random numbers, fills frozen bits with 0, constructs a vector with equal length as the screened secret key, encodes the vector, then xors the vector with the screened secret key, and sends the result to Bob; and after receiving the result, bob exclusive-ors the result with the screened key to generate a decoding vector, and decodes the decoding vector by taking the frozen bit as 0 to realize error correction. The bit inversion decoding configuration method can ensure that the frozen bit in the decoding process is 0, thereby supporting a high-speed decoder. However, the method requires participation of true random numbers, which can lead to complexity improvement of the system and potential safety hazard.
Therefore, in order to meet the requirements that the polarization codes do not need to be random in information coordination and support a high-speed decoder, the design of the erasure decoding configuration method of the polarization codes in information coordination has important significance.
Disclosure of Invention
The invention aims to provide an erasure decoding configuration method and device for polarization codes in information coordination, which overcome the defects in the prior art.
In order to achieve the above purpose, the technical scheme adopted by the invention is as follows:
an erasure decoding configuration method of polarization codes in information coordination comprises the following steps:
s1, a communication party Alice filters a filtered secret key K with a length of n S,A Performing polarization code encoding to obtain codeword vector W, and extracting corresponding frozen bit W from W by communication party Alice according to pre-shared frozen vector V with information bit length k V The communication party Alice uses the classical channel to transmit W V Transmitting to the communication other party Bob;
s2, the communication party Bob receives the frozen bit W through a classical channel V With a preset decoded frozen bit value Z V Exclusive or to obtain
Figure BDA0003713661760000021
The communication party Bob constructs a vector Y with a length of n, and fills 0 in the information bit of the check vector according to the frozen vector, and fills in the frozen bit +.>
Figure BDA0003713661760000022
The communication other party Bob carries out polarization code encoding on the vector Y to obtain a check vector U;
s3, the communication party Bob uses the check vector U and the filtered secret key K S,B After exclusive or, obtain the decoding vector
Figure BDA0003713661760000023
Figure BDA0003713661760000024
The other party Bob of communication decodes the frozen bit value Z according to the frozen vector V and the preset V For decoding vector->
Figure BDA0003713661760000025
Figure BDA0003713661760000026
Decoding is carried out to obtain a decoding result vector Z;
s4, the party of communication Alice selects the secret key K S,A As the coordinated key, the communication party Bob performs polarization code encoding on the decoding result vector Z to X, and encodes
Figure BDA0003713661760000027
As a post-reconciliation key.
Further, the method further comprises the step of replacing the step S4 with: the communication party Alice selects the information bit w\w in W V As a coordinated key, the communication party Bob selects information bits z\z in the decoding result vector Z V As a post-reconciliation key.
The invention also provides a device for configuring the erasure decoding of the polarization code in the information coordination, which comprises:
the polarization code encoding module is used for the communication party Alice to screen the key K with the length of n S,A Performing polarization code encoding to obtain codeword vector W, and extracting corresponding frozen bit W from W by communication party Alice according to pre-shared frozen vector V with information bit length k V The communication party Alice uses the classical channel to transmit W V Transmitting to the communication other party Bob;
a check vector generation module for receiving the frozen bit W by the communication party Bob through the classical channel V With a preset decoded frozen bit value Z V Exclusive or to obtain
Figure BDA0003713661760000028
The communication party Bob constructs a vector Y with a length of n, and fills 0 in the information bit of the check vector according to the frozen vector, and fills in the frozen bit +.>
Figure BDA0003713661760000029
The communication other party Bob carries out polarization code encoding on the vector Y to obtain a check vector U;
a verification information erasing and decoding module for the communication of the other party Bob throughThe verification vector U and the key K after screening S,B After exclusive or, obtain the decoding vector
Figure BDA00037136617600000210
The other party Bob of communication decodes the frozen bit value Z according to the frozen vector V and the preset V For decoding vector->
Figure BDA00037136617600000211
Decoding is carried out to obtain a decoding result vector Z;
a coordinated key generation module for selecting a key K by a party Alice S,A As the coordinated key, the communication party Bob performs polarization code encoding on the decoding result vector Z to X, and encodes
Figure BDA00037136617600000212
As a post-coordination key, or for a communication party Alice to select information bits W\W in W V As a coordinated key, the communication party Bob selects information bits z\z in the decoding result vector Z V As a post-reconciliation key.
Compared with the prior art, the invention has the advantages that: according to the erasure decoding configuration method and device for the polarization code in information coordination, provided by the invention, the influence of frozen bits of the code words at the Alice end of one communication party on the key after screening of the other communication party Bob is removed by adopting the exclusive or erasure operation, so that a preselected frozen bit value can be adopted when the other communication party Bob decodes, and the frozen bits can be ensured to be fixed when decoding without participation of a true random number; the invention avoids participation of true random numbers through the erasing operation, and can still support a high-speed decoder requiring frozen bits to be a fixed value under the condition of avoiding participation of the true random numbers, thereby reducing the complexity of the system and avoiding possible potential safety hazards.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of an erasure decoding configuration method of polarization codes in information coordination according to the present invention.
Fig. 2 is a schematic diagram of an erasure decoding configuration apparatus for polarization codes in information coordination according to the present invention.
Detailed Description
The preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings so that the advantages and features of the present invention can be more easily understood by those skilled in the art, thereby making clear and defining the scope of the present invention.
Referring to fig. 1, the present embodiment discloses an erasure decoding configuration method for polarization codes in information coordination, which includes the following steps:
and S1, encoding polarization codes. The communication party Alice filters the key K with the length of n S,A Performing polarization code encoding to obtain codeword vector W, and extracting corresponding frozen bit W from W by communication party Alice according to pre-shared frozen vector V with information bit length k V The communication party Alice uses the classical channel to transmit W V Transmitting to the communication other party Bob;
step S2, the communication party Bob receives the frozen bit W through the classical channel V With a preset decoded frozen bit value Z V (e.g. 0) exclusive OR
Figure BDA0003713661760000031
The communication party Bob constructs a vector Y with a length of n, and fills 0 in the information bit of the check vector according to the frozen vector, and fills in the frozen bit +.>
Figure BDA0003713661760000032
The other party Bob of communication performs polarization code encoding on the vector Y to obtain a check vector U.
Step S3, the communication party Bob uses the check vector U and the filtered secret key K S,B After exclusive or, obtain the decoding vector
Figure BDA0003713661760000033
The other party Bob of communication decodes the frozen bit value Z according to the frozen vector V and the preset V For decoding vector
Figure BDA0003713661760000034
Decoding is carried out to obtain a decoding result vector Z;
step S4, the party Alice selects the key K S,A As the coordinated key, the communication party Bob performs polarization code encoding on the decoding result vector Z to X, and encodes
Figure BDA0003713661760000035
As a post-reconciliation key.
The keys have another option after reconciliation: namely, step S4 is replaced with: the communication party Alice selects the information bit w\w in W V As a coordinated key, the communication party Bob selects information bits z\z in the decoding result vector Z V As a post-reconciliation key.
In the present embodiment, the communication party Bob uses the received frozen bit W V And a preset decoded frozen bit value Z V And (3) coding, performing exclusive OR with the screened key with the error code, and erasing the influence of verification information in the screened key.
In this embodiment, the communication party Bob decodes the decoding vector according to the pre-selected frozen bit and the frozen vector, and compared with the prior art, the communication party Bob can support the existing high-speed decoder without participation of true random numbers, so as to improve the throughput rate of information coordination.
Referring to fig. 2, the present invention further provides a device for configuring erasure decoding of the polarization code in information coordination, including: a polarization code encoding module 1 for a communication party Alice to select a filtered key K with a length of n S,A Performing polarization code encoding to obtain codeword vector W, and extracting corresponding frozen bit W from W by communication party Alice according to pre-shared frozen vector V with information bit length k V The communication party Alice uses the classical channel to transmit W V Transmitting to the communication other party Bob; a check vector generation module 2 for receiving the frozen bit W by the communication party Bob via classical channel V With a preset decoded frozen bit value Z V Exclusive or to obtain
Figure BDA0003713661760000041
The communication party Bob constructs a vector Y with a length of n, and fills 0 in the information bit of the check vector according to the frozen vector, and fills in the frozen bit +.>
Figure BDA0003713661760000042
The communication other party Bob carries out polarization code encoding on the vector Y to obtain a check vector U; a verification information erasing and decoding module 3 for communicating the other party Bob by combining the verification vector U with the filtered key K S,B After exclusive OR, the decoding vector is obtained>
Figure BDA0003713661760000043
The other party Bob of communication decodes the frozen bit value Z according to the frozen vector V and the preset V For decoding vector->
Figure BDA0003713661760000044
Decoding is carried out to obtain a decoding result vector Z; a coordinated key module 4 is generated for the communication party Alice to select the key K S,A As a key after coordination, the communication party Bob performs polarization code encoding of the decoding result vector Z to X and encodes +.>
Figure BDA0003713661760000045
As a post-coordination key, or for a communication party Alice to select information bits W\W in W V As a coordinated key, the communication party Bob selects information bits z\z in the decoding result vector Z V As a post-reconciliation key.
The invention adopts the exclusive or erasure operation to remove the influence of the frozen bit of the codeword at the Alice end of the communication party on the key after the filtering of the Bob of the other party, so that the pre-selected frozen bit value can be adopted when the Bob of the other party decodes, and compared with the prior art, the frozen bit fixation during decoding can be ensured without the participation of true random numbers.
Compared with the prior art, the invention can still support a high-speed decoder requiring the frozen bit to be a fixed value under the condition of avoiding the participation of the true random number, and can reduce the complexity of the system and avoid possible potential safety hazards.
Although the embodiments of the present invention have been described with reference to the accompanying drawings, the patentees may make various modifications or alterations within the scope of the appended claims, and are intended to be within the scope of the invention as described in the claims.

Claims (3)

1. An erasure decoding configuration method of polarization codes in information coordination is characterized by comprising the following steps:
s1, a communication party Alice filters a filtered secret key K with a length of n S,A Performing polarization code encoding to obtain codeword vector W, and extracting corresponding frozen bit W from W by communication party Alice according to pre-shared frozen vector V with information bit length k V The communication party Alice uses the classical channel to transmit W V Transmitting to the communication other party Bob;
s2, the communication party Bob receives the frozen bit W through a classical channel V With a preset decoded frozen bit value Z V Exclusive or to obtain
Figure FDA0003713661750000011
The communication party Bob constructs a vector Y with a length of n, and fills 0 in the information bit of the check vector according to the frozen vector, and fills in the frozen bit +.>
Figure FDA0003713661750000012
The communication party Bob performs the polar operation on the vector YCoding the code to obtain a check vector U;
s3, the communication party Bob uses the check vector U and the filtered secret key K S,B After exclusive or, obtain the decoding vector
Figure FDA0003713661750000013
Figure FDA0003713661750000014
The other party Bob of communication decodes the frozen bit value Z according to the frozen vector V and the preset V For decoding vector->
Figure FDA0003713661750000015
Figure FDA0003713661750000016
Decoding is carried out to obtain a decoding result vector Z;
s4, the party of communication Alice selects the secret key K S,A As the coordinated key, the communication party Bob performs polarization code encoding on the decoding result vector Z to X, and encodes
Figure FDA0003713661750000017
As a post-reconciliation key.
2. The method of configuring erasure decoding for polarization codes in information coordination according to claim 1, further comprising replacing step S4 with: the communication party Alice selects the information bit w\w in W V As a coordinated key, the communication party Bob selects information bits z\z in the decoding result vector Z V As a post-reconciliation key.
3. An apparatus for an erasure decoding configuration method in information coordination of a polarization code according to claim 1 or 2, comprising:
the polarization code encoding module is used for the communication party Alice to screen the key K with the length of n S,A Performing polarization code encoding to obtain codeword vectorW, the communication party Alice extracts the corresponding frozen bit W in W according to the frozen vector V with the pre-shared information bit length of k V The communication party Alice uses the classical channel to transmit W V Transmitting to the communication other party Bob;
a check vector generation module for receiving the frozen bit W by the communication party Bob through the classical channel V With a preset decoded frozen bit value Z V Exclusive or to obtain
Figure FDA0003713661750000018
The communication party Bob constructs a vector Y with a length of n, and fills 0 in the information bit of the check vector according to the frozen vector, and fills in the frozen bit +.>
Figure FDA0003713661750000019
The communication other party Bob carries out polarization code encoding on the vector Y to obtain a check vector U;
the verification information erasing and decoding module is used for the communication party Bob to erase the verification vector U and the filtered secret key K S,B After exclusive or, obtain the decoding vector
Figure FDA00037136617500000110
The other party Bob of communication decodes the frozen bit value Z according to the frozen vector V and the preset V For decoding vector->
Figure FDA00037136617500000111
Decoding is carried out to obtain a decoding result vector Z;
a coordinated key generation module for selecting a key K by a party Alice S,A As the coordinated key, the communication party Bob performs polarization code encoding on the decoding result vector Z to X, and encodes
Figure FDA00037136617500000112
As a post-coordination key, or for a communication party Alice to select information bits W\W in W V As a coordinated key, bob, the other party of communication, selects the decoding result vector ZInformation bit Z/Z in (a) V As a post-reconciliation key.
CN202210731417.XA 2022-06-24 2022-06-24 Erasing and decoding configuration method and device of polarization code in information coordination Active CN115118417B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210731417.XA CN115118417B (en) 2022-06-24 2022-06-24 Erasing and decoding configuration method and device of polarization code in information coordination

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210731417.XA CN115118417B (en) 2022-06-24 2022-06-24 Erasing and decoding configuration method and device of polarization code in information coordination

Publications (2)

Publication Number Publication Date
CN115118417A CN115118417A (en) 2022-09-27
CN115118417B true CN115118417B (en) 2023-07-04

Family

ID=83329639

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210731417.XA Active CN115118417B (en) 2022-06-24 2022-06-24 Erasing and decoding configuration method and device of polarization code in information coordination

Country Status (1)

Country Link
CN (1) CN115118417B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109327226A (en) * 2017-08-04 2019-02-12 华为技术有限公司 Coding and decoding method, device and the equipment of polarization code
CN109921904A (en) * 2019-04-28 2019-06-21 哈尔滨工业大学（深圳） Based on classics-quantum polarisation channel highly effective quantum cryptographic key distribution method and system
CN111200442A (en) * 2018-11-20 2020-05-26 华为技术有限公司 Coding and decoding method, coding and decoding device and system
CN113746624A (en) * 2021-09-04 2021-12-03 中国人民解放军国防科技大学 Physical layer security key extraction method based on fuzzy extractor negotiation
CN114422081A (en) * 2021-12-28 2022-04-29 华南师范大学 QKD post-processing system and method based on CRC-SCL decoding algorithm

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018145242A1 (en) * 2017-02-07 2018-08-16 Qualcomm Incorporated A low complexity puncturing method for low-rate polar codes

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109327226A (en) * 2017-08-04 2019-02-12 华为技术有限公司 Coding and decoding method, device and the equipment of polarization code
CN111200442A (en) * 2018-11-20 2020-05-26 华为技术有限公司 Coding and decoding method, coding and decoding device and system
CN109921904A (en) * 2019-04-28 2019-06-21 哈尔滨工业大学（深圳） Based on classics-quantum polarisation channel highly effective quantum cryptographic key distribution method and system
CN113746624A (en) * 2021-09-04 2021-12-03 中国人民解放军国防科技大学 Physical layer security key extraction method based on fuzzy extractor negotiation
CN114422081A (en) * 2021-12-28 2022-04-29 华南师范大学 QKD post-processing system and method based on CRC-SCL decoding algorithm

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Efficient Method for Frozen Bits Encoding and Decoding of Polar Code;Yan-Haw Chen et.al;《2018 2nd International Conference on Data Mining, Communications and Information Technology (DMCIT 2018)》;全文 *
极化码连续消除译码算法的优化研究;王婷;《中国优秀硕士学位论文全文数据库》;全文 *

Also Published As

Publication number Publication date
CN115118417A (en) 2022-09-27

Similar Documents

Publication Publication Date Title
CN110011792B (en) Single-step quantum key distribution post-processing method, system, medium and equipment based on polar code
CN104468097B (en) A kind of secure data communication implementation method based on quantum key distribution
CN101779190B (en) Information transmission and integrated protection method
CN107360568B (en) Method for realizing symmetric encryption and guaranteeing wireless data secure transmission by utilizing fountain codes
EP0966126A2 (en) Encrypting speech coder
CN103167490B (en) Wireless key distribution method, Apparatus and system
JPS62283742A (en) Data transmission
US20130051556A1 (en) System for encrypting data with an error correction code
CN109039532A (en) A kind of joint error correction time slot scrambling based on Raptor code
CN111092664B (en) Channel capacity increasing method for quantum secure communication irrelevant to measuring equipment
CN107231215B (en) Polarization code-based safe transmission method under parallel channel
CN109640095A (en) A kind of video encryption system of binding capacity quantum key distribution
CN106878012B (en) A kind of wireless channel physical layer key agreement and inconsistent bit minimizing technology
CN106789027B (en) Method and system for confirming consistency of secret key by using unconditional secure transmission
CN115118417B (en) Erasing and decoding configuration method and device of polarization code in information coordination
CN109617655B (en) Polarization code wireless data secure transmission method based on random scrambling code assistance
US20150365107A1 (en) Data transmission method and apparatus
JP2001506832A (en) Receiver decoder circuit and associated method for decoding channel encoded signals
CN111641500B (en) Encryption and decryption method for wireless video transmission safety of unmanned aerial vehicle
EP1053598B1 (en) Precoding technique to lower the bit error rate (ber) of punctured convolutional codes
CN116566597A (en) Controllable security level covert communication method based on bit coin address confusion ciphertext
CN110266321A (en) A kind of new communication means and system based on polarization code
CN108631944A (en) A kind of channel-polarization secure coding method based on robust orphan distribution
CN108234077A (en) A kind of punctured safe Turbo coding methods of dynamic by cipher control
JP2008028806A (en) Information transmission method, information reception method, information transmission device, information reception device, and program

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
GR01 Patent grant
GR01 Patent grant