CN106059713B - A method of first kind tapping channel is constructed by BSBC - Google Patents

A method of first kind tapping channel is constructed by BSBC Download PDF

Info

Publication number
CN106059713B
CN106059713B CN201610586991.5A CN201610586991A CN106059713B CN 106059713 B CN106059713 B CN 106059713B CN 201610586991 A CN201610586991 A CN 201610586991A CN 106059713 B CN106059713 B CN 106059713B
Authority
CN
China
Prior art keywords
channel
legitimate
listener
information
sequence
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.)
Expired - Fee Related
Application number
CN201610586991.5A
Other languages
Chinese (zh)
Other versions
CN106059713A (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.)
Henan University of Science and Technology
Original Assignee
Henan University of Science and 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 Henan University of Science and Technology filed Critical Henan University of Science and Technology
Priority to CN201610586991.5A priority Critical patent/CN106059713B/en
Publication of CN106059713A publication Critical patent/CN106059713A/en
Application granted granted Critical
Publication of CN106059713B publication Critical patent/CN106059713B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/0001Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0009Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045Arrangements at the receiver end
    • H04L1/0054Maximum-likelihood or sequential decoding, e.g. Viterbi, Fano, ZJ algorithms
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/02Arrangements for detecting or preventing errors in the information received by diversity reception
    • H04L1/06Arrangements for detecting or preventing errors in the information received by diversity reception using space diversity
    • H04L1/0618Space-time coding
    • H04L1/0675Space-time coding characterised by the signaling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L25/03178Arrangements involving sequence estimation techniques
    • H04L25/03312Arrangements specific to the provision of output signals
    • H04L25/03318Provision of soft decisions
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00Network architectures or network communication protocols for network security
    • H04L63/30Network architectures or network communication protocols for network security for supporting lawful interception, monitoring or retaining of communications or communication related information

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Computer Security & Cryptography (AREA)
  • Technology Law (AREA)
  • Computer Hardware Design (AREA)
  • Artificial Intelligence (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Power Engineering (AREA)
  • Quality & Reliability (AREA)
  • Error Detection And Correction (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

A method of first kind tapping channel being constructed by BSBC, legitimate receiver sends feedback information to legitimate sender by Binary Symmetric broadcast channel;Legitimate sender and listener-in respectively receive the feedback information of the legitimate receiver by noise jamming, and legitimate sender is handled encoded information to be sent according to the feedback information received, are then sent out by the common signal channel of zero defect;Legitimate receiver passes through bit log-likelihood ratio information needed for ad hoc fashion extracts Soft decision decoding first, then the information received is decoded by Soft decision decoding mode, reduce the wrong bitrate of main channel, improve channel reliability, and then expand quality difference between main channel and tapping channel, improve the safe capacity of first kind tapping channel;The information that listener-in's passive wiretapping legitimate sender is sent, and the information received is decoded by way of Soft decision decoding.The present invention realizes that difficulty is low, and channel safety capacity is high, good communication quality.

Description

A method of first kind tapping channel is constructed by BSBC
Technical field
It is specifically a kind of that first kind tapping channel is constructed by BSBC the invention belongs to technical field of communication safety and comprising Method.
Background technique
With the fast development of information technology, personal information and business information transmission to the dependence of cordless communication network just It is remarkably reinforced, thus the attention rate of derivative communication system inherently safe problem is also improving rapidly.Based on open system interconnection 7 Layer protocol, the Information Security Mechanism of legacy communications system be built upon network layer and its more than each layer, core technology is key Encryption mechanism, with the proviso that unimpeded and error-free transmission link has been provided in the physical layer of agreement bottom, physical layer information is asked safely Topic does not cause enough attention.However, due to the opening and versatility of electromagnetic signal transmission environment, in the effective of transmission power In coverage area, any third party for possessing suitable equipment can quietly access network and steal other people information, to wireless communication Privacy and safety bring great threat.With the diversification of the high speed and wireless traffic of wireless data transmission, especially In the 5th Generation Mobile Communication System scene that there is " height conversion, high density and high speed " to require, information stealth bring Harm and loss are difficult to estimate.Therefore, compared to the cable network of physical transmission medium relative closure, the object of cordless communication network It is more serious to manage layer information security issue, it is studied extremely urgent.
Wyner proposes WTC-I model 1975, and in WTC-I model, legitimate receiver and listener-in receive hair simultaneously The data that the side of sending is sent out.It is inferior to main channel in listener-in's channel quality, i.e. the channel of legitimate correspondence both sides will have in quality Under advantageous assumed condition, sharing key is not depended on, by reasonable under the premise of transmission rate is no more than safe capacity Perfect confidential corespondence can be realized in secure coding schemes.But listener-in's channel quality is inferior to the assumed condition of main channel in reality It is difficult to ensure that, for example listener-in is close apart from private information sender, and receiving antenna power is high, then can guarantee easily in border It receives the bit error rate and is lower than legitimate receiver.The model also demonstrates the realizability of unconditional security communication, does not suggest that How WTC and reasonable secure coding schemes are constructed.As it can be seen that building WTC and safe coding are the two of unconditional security communication Big key technology.
Currently, based on the single antenna communications system building research of WTC-I and few, as domestic first single antenna WTC-I The invention of model, Chinese patent " CN200910058796.5 " disclosed " constructing wire-tapI by feedback and with LDPC code " is special What is proposed in benefit is received significant attention based on the WTC-I model interactively communicated, realizes that process has two big distinguishing features: (1) The noise of main channel is transferred on listener-in's channel in interactive process by the design of reasonable algorithm, fundamentally establishes master Channel quality advantage;(2) Hard decision decoding algorithm threshold effect is utilized, realizes improvement optimization and the listener-in's letter of main channel quality Road quality degradation is kept, thus the channel quality advantage that " amplification " has built up.But the program still has some shortcomings: (1) legitimate sender is needed by the transmission for having the common signal channel made an uproar to carry out information, it is therefore necessary to by reducing information transmission speed Rate simultaneously combines the technological means such as strong error correcting code to make common signal channel completely reliable, adds additional the complexity of system realization Degree;(2) the weaker error correcting capability of Hard decision decoding algorithm causes main channel reliability not high, makes to the channel matter having built up The expansion effect of amount advantage is not obvious, also will cause Subsequent secure and the maximum safe transmission rate-limit that reliably encodes not It is high.
Summary of the invention
In order to solve deficiency in the prior art, the present invention provides one kind under Binary Symmetric broadcast channel, and utilization is soft Judgement decoding makes main channel safe capacity and the higher secure channels model of reliability to substitute Hard decision decoding.
A method of first kind tapping channel being constructed by BSBC, legitimate receiver passes through Binary Symmetric broadcast channel Feedback information is sent to legitimate sender;Legitimate sender and listener-in respectively receive by noise jamming legitimate receiver it is anti- Feedforward information, legitimate sender are handled encoded information to be sent according to the feedback information received, then pass through nothing The common signal channel of mistake is sent out, and the auxiliary channel without safety guarantee is selected as to the common signal channel of zero defect, is reduced system and is realized Complexity;Bit log-likelihood ratio information needed for legitimate receiver extracts Soft decision decoding first, then by soft Judgement decoded mode decodes the information received, reduces the wrong bitrate of main channel, improves channel reliability, Jin Erkuo Quality difference between big main channel and tapping channel, improves the safe capacity of first kind tapping channel;Listener-in's passive wiretapping closes The information that method sender sends, and the information received is decoded by way of Soft decision decoding.
Concrete implementation step of the present invention are as follows:
Step 1: legitimate receiver is randomly generated, t (t >=1) is a mutually indepedent and each N long binary system sequence more general than top grade ColumnAnd send it by Binary Symmetric broadcast channel, legitimate sender and listener-in receive respectively To t sequenceWithWherein ej=[eJ, i] and eaj=[eaJ, i] it is that Binary Symmetric is wide The error vector of channel is broadcast,Indicate 2 He of mould, and 1≤i≤N;
Step 2: legitimate sender generates t-1 mutually indepedent and each N long binary sequence cs more general than top grade at randomj [cJ, i] spare, wherein 1≤j≤t-1,1≤i≤N;
Step 3: legitimate sender is secret to sent K long using binary (N, the K) linear block codes for approaching shannon limit Information x obtains N long message sequence c=[c after being encodedi], 1≤i≤N;By c and { cj, 1≤j≤t-1 } and generate t-th of N long Sequence ct:
Step 4: by t-1 sequence in step 2 and the c in step 3tTotal t N long Sequence composition set { cj, 1≤j ≤ t }, by { cjIn element and setMiddle element is gathered with after according to subscript one-to-one correspondence progress mould 2 {y′j, 1≤j≤t }, i.e.,Legitimate sender is by { y 'jSent by the common signal channel of zero defect;
Step 5: the information for assuming that listener-in transmits common signal channel is also passive wiretapping, without usurping to it Other operations such as change, then legitimate receiver and listener-in can free of errors receive { y 'j, legitimate receiver is by oneself in step The zero defect arrangement set possessed in rapid oneWith { y 'jIn sequence carry out whole 2 He of mould, i.e., by each position It sets corresponding element and carries out 2 He of mould, obtain N long sequence1≤i≤N, listener-in then connect oneself in step 1 The arrangement set by noise jamming receivedWith { y 'jIn sequence carry out whole mould 2 and obtain N long sequence1≤i≤N, i.e.,
Step 6: firstly, for 1≤i≤N, 1≤j≤t, legitimate receiver and listener-in respectively by following formula (1) and Formula (2)
It calculatesWithBit error probabilityWithWherein αJ, iFor channel error vector ejI-th of bit eJ, i For the probability of " 1 ", βJ, iFor channel error vector eajI-th of bit eaJ, iFor the probability of " 1 ", secondly, for 1≤i≤N, Legitimate receiver and listener-in are respectively by following formula (3) and formula (4)
Calculate the bit log-likelihood ratio value about c;
Step 7: the bit log-likelihood ratio value acquired using formula (3) and formula (4), legitimate receiver and listener-in's difference K long secret information is recovered after being decoded using soft-decision algorithm respectivelyWith
As a preferred embodiment, [N, the K] linear block codes of binary described in step 3 is low density parity check code.
As a preferred embodiment, soft-decision algorithm described in step 7 is that low-density is odd under Binary Symmetric broadcast channel The belief propagation algorithm of even parity check code.
The utility model has the advantages that the present invention selects the common signal channel of zero defect as auxiliary between legitimate sender and legitimate receiver Channel is helped, the complexity of system realization can be greatly reduced;Based on ad hoc fashion extract bit log-likelihood ratio information into And the reliability of main channel can be significantly improved using the construction method of Soft decision decoding, and the bit error probability of listener-in is being translated Code front and back is held essentially constant, therefore the channel quality advantage of legitimate correspondence is greatly enhanced, to increase entire steal Listen the safe capacity of channel model, moreover it is possible to the upper limit of maximum safe transmission rate for improving Subsequent secure and reliably encoding.
Detailed description of the invention
Fig. 1 is physical layer unconditional security traffic model schematic diagram;
Fig. 2 is based on WTC-I (IWTC-I) model schematic interactively communicated;
Fig. 3 is simulation result diagram.
Specific embodiment
A specific embodiment of the invention are as follows:
A method of first kind tapping channel being constructed by BSBC, legitimate receiver (being denoted as Bob) passes through binary system pair Broadcast channel (BSBC) is claimed to send feedback information to legitimate sender (being denoted as Alice);Legitimate sender and listener-in (are denoted as Eve the feedback information of the legitimate receiver by noise jamming) is respectively received, legitimate sender is according to the feedback information pair received Encoded information to be sent is handled, and is then sent out by the common signal channel of zero defect, and the auxiliary of safety guarantee will be not necessarily to Channel is selected as the common signal channel of zero defect, reduces the complexity that system is realized;Legitimate receiver is mentioned by ad hoc fashion first Then bit log-likelihood ratio information needed for taking out Soft decision decoding carries out the information received by Soft decision decoding mode Decoding reduces the wrong bitrate of main channel, improves channel reliability, and then expands of poor quality between main channel and tapping channel It is different, improve the safe capacity of first kind tapping channel;The information that listener-in's passive wiretapping legitimate sender is sent, and sentenced by soft The mode certainly decoded decodes the information received.
Specific implementation steps are as follows:
Step 1: Bob is randomly generated, t (t >=1) is a mutually indepedent and each N long binary sequence more general than top grade(1 ≤ j≤t), and it is sent by BSBC, Alice and Eve receive t sequence respectivelyWithWherein ej=[eJ, i] and eaj=[eaJ, i] be BSBC error vector,Indicate 2 He of mould, and 1 ≤i≤N;
Step 2: Alice generates t-1 mutually indepedent and each N long binary sequence cs more general than top grade at randomj= [cJ, i] spare, wherein 1≤j≤t-1,1≤i≤N;
Step 3: Alice utilizes binary (N, the K) linear block codes for approaching shannon limit to sent K long secret information x N long message sequence c=[c is obtained after being encodedi], 1≤i≤N;By c and { cj, 1≤j≤t-1 } and generate t-th of N long sequence ct:
Step 4: by t-1 sequence in step 2 and the c in step 3tTotal t N long Sequence composition set { cj, 1≤j ≤ t }, by { cjIn element and setMiddle element is collected with after according to subscript one-to-one correspondence progress mould 2 Close { y 'j, 1≤j≤t }, i.e.,Alice is by { y 'jSent by the common signal channel of zero defect;
Step 5: the information transmitted in Eve to common signal channel is also passive wiretapping, without carrying out distorting etc. it to it In the case that he operates, Bob and Eve can free of errors receive { y 'j, the indifference that Bob possesses oneself in step 1 Wrong arrangement setWith { y 'jIn sequence carry out whole 2 He of mould, i.e., by element corresponding on each position 2 He of mould is carried out, N long sequence is obtained1≤i≤N, Eve then oneself is received in step 1 by noise jamming Arrangement setWith { y 'jIn sequence carry out whole mould 2 and obtain N long sequence1≤i≤N, i.e.,
Step 6: 1≤j≤t, Bob and Eve are respectively by following formula (1) and formula (2) firstly, for 1≤i≤N
It calculatesWithBit error probabilityWithWherein αJ, iFor channel error vector ejI-th of bit eJ, i For the probability of " 1 ", βJ, iFor channel error vector eajI-th of bit eaJ, iFor the probability of " 1 ", secondly, for 1≤i≤N, Bob and Eve is respectively by following formula (3) and formula (4)
Calculate the bit log-likelihood ratio value about c;
Step 7: the bit log-likelihood ratio value acquired using formula (3) and formula (4), soft-decision is respectively adopted in Bob and Eve Algorithm recovers K long secret information after being decoded respectivelyWith
As a preferred embodiment, [N, the K] linear block codes of binary described in step 3 is low density parity check code.
As a preferred embodiment, soft-decision algorithm described in step 7 is the confidence of low density parity check code under BSBC Propagation algorithm.
The theoretical foundation of the step 6 are as follows:
Firstly, byWith It is found thatEqual to ej=[eJ, i] in comprising " 1 " total amount be odd number probability,Equal to ej=[eJ, i] and eaj=[eaJ, i] In comprising " 1 " total amount be odd number probability.
Secondly, it has been known that there is theorems: a n long binary sequence, if the probability that its jth position is " 1 " is pj, then entirely It include the probability of odd number " 1 " in sequence are as follows:Then according to known to the theorem:
Wherein αJ, iFor channel error vector ejI-th of bit eJ, iFor 1 probability, βJ, iFor channel error vector eaj's I-th of bit eaJ, iFor 1 probability, 1≤j≤t, 1≤i≤N.α in formula (5) and formula (6)J, iAnd βJ, iThe as mistake of BSBC Transition probability.
Finally, extracting LLR value by taking Bob as an example.ByIt is found that working asShi You
WhenShi You
By similar methods, Eve can obtain the LLR value about c.
From the figure 3, it may be seen that notional result and the simulation result goodness of fit of the invention is higher, it was demonstrated that bit after interaction of the invention Error probability expression formula is completely reliable, and the bit log-likelihood ratio value extracted accordingly is completely credible, by Soft decision decoding building the The method of a kind of tapping channel is feasible and highly-safe, performance is good.
Although not providing the simulation result of Hard decision decoding, Soft decision decoding algorithm well known in the art is considered Can be better than Hard decision decoding, therefore it can be concluded that relative to using Hard decision decoding construction method, base of the present invention Bit log-likelihood ratio information is extracted in ad hoc fashion and then uses Soft decision decoding that main channel quality is significantly improved, And the noise level of listener-in is still higher than decoding threshold, therefore decode front and back bit error probability and be held essentially constant, therefore it is entire The safe capacity of tapping channel model is significantly improved.

Claims (2)

1. it is a kind of by BSBC construct first kind tapping channel method, it is characterised in that: legitimate receiver by BSBC (two into Make symmetrical broadcast channel) feedback information is sent to legitimate sender, legitimate sender and listener-in respectively receive by noise jamming Legitimate receiver feedback information, specific method includes step 1:
Step 1: legitimate receiver is randomly generated t, t >=1 is mutually indepedent and each N long binary sequence more general than top grade And send it by Binary Symmetric broadcast channel, legitimate sender and listener-in receive t sequence respectivelyWithWherein ej=[ej,i] and eaj=ea [j,i] be Binary Symmetric broadcast channel error vector,Indicate 2 He of mould, and 1≤i≤N;
Legitimate sender is handled encoded information to be sent according to the feedback information received, then passes through zero defect Common signal channel send out, the auxiliary channel without safety guarantee is selected as the common signal channel of zero defect, what reduction system was realized answers Miscellaneous degree, specific method include step 2 to four;
Step 2: legitimate sender generates t-1 mutually indepedent and each N long binary sequence cs more general than top grade at randomj= [cj,i] spare, wherein 1≤j≤t-1,1≤i≤N;
Step 3: legitimate sender utilizes binary N, the K linear block codes for approaching shannon limit to sent K long secret information x N long message sequence c=c is obtained after being encodedi, 1≤i≤N;By c and { cj, 1≤j≤t-1 } and generate t-th of N long sequence ct:Binary [N, K] linear block codes is low density parity check code;
Step 4: by t-1 sequence in step 2 and the c in step 3tTotal t N long Sequence composition set { cj,1≤j≤ T }, by { cjIn element and setElement corresponds according to subscript and carries out 2 He of mould in 1≤j≤t, i.e., will be on each position Corresponding element carries out 2 He of mould, is then gathered { y'j, 1≤j≤t }, i.e.,Legitimate sender is by { y'jBy nothing The common signal channel of mistake is sent;
Bit log-likelihood ratio information, then passes through Soft decision decoding needed for legitimate receiver extracts Soft decision decoding first Mode decodes the information received, reduces the wrong bitrate of main channel, improves channel reliability, and then expand main channel The quality difference between tapping channel improves the safe capacity of first kind tapping channel, listener-in's passive wiretapping legitimate sender The information of transmission, and being decoded by way of Soft decision decoding to the information received, specific method include step 5 to seven:
Step 5: the information for assuming that listener-in transmits common signal channel is also passive wiretapping, without distorting etc. to it Other operations, then legitimate receiver and listener-in can free of errors receive { y'j, legitimate receiver is by oneself in step 1 In the zero defect arrangement set that possessesWith { y'jIn sequence carry out whole mould 2 and obtain N long sequenceThe arrangement set by noise jamming that listener-in then receives oneself in step 1With {y'jIn sequence carry out whole mould 2 and obtain N long sequenceI.e.
Step 6: 1≤j≤t, legitimate receiver and listener-in are respectively by following formula (1) and formula firstly, for 1≤i≤N (2)
It calculatesWithBit error probabilityWithWherein αj,iFor channel error vector ejI-th of bit ej,iFor " 1 " Probability, βj,iFor channel error vector eajI-th of bit eaj,iFor the probability of " 1 ", secondly, for 1≤i≤N, legitimate receipt Person and listener-in are respectively by following formula (3) and formula (4)
Calculate the bit log-likelihood ratio value about c;
Step 7: the bit log-likelihood ratio value acquired using formula (3) and formula (4), legitimate receiver and listener-in are sentenced using soft Annual reporting law recovers K long secret information after being decoded respectivelyWith
2. a kind of method for constructing first kind tapping channel by BSBC as described in claim 1, it is characterised in that: step 7 The soft-decision algorithm is the belief propagation algorithm of low density parity check code under Binary Symmetric broadcast channel.
CN201610586991.5A 2016-07-25 2016-07-25 A method of first kind tapping channel is constructed by BSBC Expired - Fee Related CN106059713B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610586991.5A CN106059713B (en) 2016-07-25 2016-07-25 A method of first kind tapping channel is constructed by BSBC

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610586991.5A CN106059713B (en) 2016-07-25 2016-07-25 A method of first kind tapping channel is constructed by BSBC

Publications (2)

Publication Number Publication Date
CN106059713A CN106059713A (en) 2016-10-26
CN106059713B true CN106059713B (en) 2019-01-29

Family

ID=57416760

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610586991.5A Expired - Fee Related CN106059713B (en) 2016-07-25 2016-07-25 A method of first kind tapping channel is constructed by BSBC

Country Status (1)

Country Link
CN (1) CN106059713B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106533625B (en) * 2016-11-29 2019-09-06 河南科技大学 A kind of safe transmission method of physical layer suitable for ZigBee-network stelliform connection topology configuration
CN106789027B (en) * 2017-01-03 2021-01-12 电子科技大学 Method and system for confirming consistency of secret key by using unconditional secure transmission
CN109257743B (en) * 2018-11-21 2021-09-14 河南科技大学 Method for constructing WTC-I through stable BSBC (binary-coded binary-block-code) without channel state information

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6965652B1 (en) * 2000-06-28 2005-11-15 Marvell International Ltd. Address generator for LDPC encoder and decoder and method thereof
CN1798012A (en) * 2004-12-30 2006-07-05 松下电器产业株式会社 Error-correcting method of calibrating reliability based on low density parity code
CN1961517A (en) * 2004-05-28 2007-05-09 法国电信公司 Method for error correction coding comprising local error detection codes, corresponding decoding method, transmitting, receiving and storage device and program

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6965652B1 (en) * 2000-06-28 2005-11-15 Marvell International Ltd. Address generator for LDPC encoder and decoder and method thereof
CN1961517A (en) * 2004-05-28 2007-05-09 法国电信公司 Method for error correction coding comprising local error detection codes, corresponding decoding method, transmitting, receiving and storage device and program
CN1798012A (en) * 2004-12-30 2006-07-05 松下电器产业株式会社 Error-correcting method of calibrating reliability based on low density parity code

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
《基于编码与信噪一体化的窃听信道模型研究》;杨志良,安建平,李祥明;《北京理工大学学报》;20150915;第35卷(第9期);全文

Also Published As

Publication number Publication date
CN106059713A (en) 2016-10-26

Similar Documents

Publication Publication Date Title
CN107360568B (en) Method for realizing symmetric encryption and guaranteeing wireless data secure transmission by utilizing fountain codes
CN103414540A (en) Degraded eavesdropping channel rate compatible method based on Polar code
CN106059713B (en) A method of first kind tapping channel is constructed by BSBC
CN104780022A (en) Physical layer secure transmission method and system based on dynamic change of channel encoding matrix
WO2011023129A1 (en) Method and equipment for ensuring communication security
CN107359929B (en) Air interface encryption method based on constellation overlapping in bidirectional relay system
Chen et al. Design and analysis of multi-level physical-layer network coding for Gaussian two-way relay channels
CN102075931A (en) Information theoretical security-based key agreement method in satellite network
CN107017960B (en) A kind of AWGN-wiretap channel anti-eavesdropping safeguard construction and its implementation based on polar code
CN109257743A (en) The method that WTC-I is constructed by steady BSBC when no channel state information
CN106100795A (en) A kind of based on inversion code word Plotkin structure and the Polar code coding cooperative of information bit heavily dormancy
CN103402185B (en) A kind of private information transfer method
Lee et al. Interference mitigation in MIMO interference channel via successive single-user soft decoding
CN106209710B (en) The method of first kind tapping channel is constructed under a kind of BI-AWGN broadcast channel
Chen et al. Spectrum-efficient coded modulation design for two-way relay channels
CN107222284B (en) The anti-eavesdropping transmission method of fountain coding based on channel feedback in a kind of Internet of Things
CN109617655A (en) A kind of polarization code wireless data safe transmission method based on random scrambling code auxiliary
Chen Physical layer security for cooperative relaying in broadcast networks
Steinberg Channels with cooperation links that may be absent
Sun et al. Secure transmission scheme for parallel relay channels based on polar coding
CN109688582A (en) Without the method based on BI-AWGN channel build WTC-I under channel state information
CN106533625B (en) A kind of safe transmission method of physical layer suitable for ZigBee-network stelliform connection topology configuration
CN103957076B (en) Building method and communication means of the novel non-linearity into shape code
CN108631944A (en) A kind of channel-polarization secure coding method based on robust orphan distribution
CN111246460B (en) Low-complexity and low-time-delay secure transmission method

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20190129

Termination date: 20190725

CF01 Termination of patent right due to non-payment of annual fee