Abstract:
An error control method and a cooperative transfer system are provided. The method comprises: each node acting as a transfer node in a cooperative node group codes an acquired distributed information code block to obtain a corresponding distributed check code block and transmits the corresponding distributed check code block to a destination node; the destination node combines a received distributed check code block to generate a check code block and combines the distributed information code block transmitted by each node acting as a source node in the cooperative node group to generate an information code block; and the destination nod decodes the check code block and the information code block. The embodiment of the present invention may increase farthest the throughput of the transfer system and obtain additional cooperative path diversity and linear block code gain.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
       [0001]    This application is a continuation of International Patent Application No. PCT/CN2006/002408, filed Sep. 15, 2006, which claims priority to Chinese Patent Application No. 200610001757.8, filed Jan. 25, 2006, both of which are hereby incorporated by reference in their entirety. 
     
    
     FIELD OF THE TECHNOLOGY 
       [0002]    The present invention relates to the communication field, and more particularly, to an error control technology. 
       BACKGROUND 
       [0003]    Since there are always noises on the communication lines, a combination of the noises with the useful information may result in errors of transferred information. In order to provide source codes with error detection and error correction capabilities, many redundancy code elements (or called monitor code elements) shall be added according to a certain rule based on source coding, so as to establish a certain relation between the redundancy code elements and transferred information code elements. The above task accomplished by a transmitting end is called an error-control coding. At a receiving end, the error detection or error correction is accomplished according to a specific relation between the information code elements and the monitor code elements so as to output information code elements. The above task is called an error-control decoding. 
         [0004]    According to an inspection relation between the information code elements and the additional monitor code elements, the error-control coding may be classified into a linear code and a non-linear code. The linear code indicates that the inspection relation between the information code elements and the additional monitor code elements is linear, that is, satisfying a set of linear equations. According to different restriction manners between the information code elements and the additional monitor code elements, the error-control coding may be classified into a block code and a convolutional code. The block code is realized by a block encoder which is a memoryless device. The block coding may be marked by (n, k), that is, k bits of information code elements are taken as a block, which are coded into a code block with a length of n bits code elements, and the length of (n−k) is the length of the monitor code elements. Each block of monitor code elements is relevant only to the information code elements in the same block and is irrelevant to the information code elements in other blocks. A coding rate is k/n. 
         [0005]    The error control in the coding and decoding processes is illustrated below by taking a linear packet code block (7, 3) as an example: 
         [0006]    Assume that an information code block input by the transmitting end is: 
         [0000]      U=[u 0  u 1  u 2 ] 
         [0007]    An output linear block information code block is: 
         [0000]      C=[c 0  c 1  c 2  c 3  c 4  c 5  c 6 ] 
         [0008]    An output check code block is: P=[p 0  p 1  p 2  p 3 ]=[c 3  c 4  c 5  c 6 ] 
         [0009]    Linear equations for performing the error-control coding are: 
         [0000]    
       
         
           
             
               
                 
                   { 
                   
                     
                       
                         Information 
                       
                     
                     
                       
                         
                           CodeElement 
                           = 
                           
                             { 
                             
                               
                                 
                                   
                                     
                                       c 
                                       0 
                                     
                                     = 
                                     
                                       u 
                                       0 
                                     
                                   
                                 
                               
                               
                                 
                                   
                                     
                                       c 
                                       1 
                                     
                                     = 
                                     
                                       u 
                                       1 
                                     
                                   
                                 
                               
                               
                                 
                                   
                                     
                                       c 
                                       2 
                                     
                                     = 
                                     
                                       u 
                                       2 
                                     
                                   
                                 
                               
                             
                           
                         
                       
                     
                     
                       
                         Monitor 
                       
                     
                     
                       
                         
                           CodeElement 
                           = 
                           
                             { 
                             
                               
                                 
                                   
                                     
                                       c 
                                       3 
                                     
                                     = 
                                     
                                       
                                         u 
                                         0 
                                       
                                       ⊕ 
                                       
                                         u 
                                         2 
                                       
                                     
                                   
                                 
                               
                               
                                 
                                   
                                     
                                       c 
                                       4 
                                     
                                     = 
                                     
                                       
                                         u 
                                         0 
                                       
                                       ⊕ 
                                       
                                         u 
                                         1 
                                       
                                       ⊕ 
                                       
                                         u 
                                         2 
                                       
                                     
                                   
                                 
                               
                               
                                 
                                   
                                     
                                       c 
                                       5 
                                     
                                     = 
                                     
                                       
                                         u 
                                         0 
                                       
                                       ⊕ 
                                       
                                         u 
                                         1 
                                       
                                     
                                   
                                 
                               
                               
                                 
                                   
                                     
                                       c 
                                       6 
                                     
                                     = 
                                     
                                       
                                         u 
                                         1 
                                       
                                       ⊕ 
                                       
                                         u 
                                         2 
                                       
                                     
                                   
                                 
                               
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   1 
                   ) 
                 
               
             
           
         
       
     
         [0010]    The above Equations (1) may be rewritten as: C=U G. 
         [0011]    G indicates a k×n generating matrix composed of two parts: G=[M Q], in which M indicates an information code element matrix in the generated matrix G and Q indicates a check code element matrix k×(n−k) in the generated matrix G. 
         [0012]    In this example, 
         [0000]    
       
         
           
             G 
             = 
             
               
                 [ 
                 
                   
                     
                       1 
                     
                     
                       0 
                     
                     
                       0 
                     
                     
                       ⋮ 
                     
                     
                       1 
                     
                     
                       1 
                     
                     
                       1 
                     
                     
                       0 
                     
                   
                   
                     
                       0 
                     
                     
                       1 
                     
                     
                       0 
                     
                     
                       ⋮ 
                     
                     
                       0 
                     
                     
                       1 
                     
                     
                       1 
                     
                     
                       1 
                     
                   
                   
                     
                       0 
                     
                     
                       0 
                     
                     
                       1 
                     
                     
                       ⋮ 
                     
                     
                       1 
                     
                     
                       1 
                     
                     
                       0 
                     
                     
                       1 
                     
                   
                 
                 ] 
               
               . 
             
           
         
       
     
         [0013]    It can be seen that M is a unit matrix 3×3. In this case, during coding, G can be generated by combining the obtained M with a check code matrix Q, and a point multiplication is performed between the G and the input information code block U and then an XOR operation is performed there-between so as to obtain the linear block information code block C. 
         [0014]    During decoding, a monitor code element matrix H corresponding to the information code block shall be obtained in advance, and it is judged whether an error occurs to the obtained information code block or not through determining whether the equation H·C T =0 T  is satisfied between the linear block information code block C and the monitor code element matrix H or not. If the equation H·C T =0 T  is satisfied between the linear block information code block C and the monitor code element matrix H, it indicates that no error occurs; and if the equation H·C T =0 T  is not satisfied between the linear block information code block C and the monitor code element matrix H, the transmitting end is informed to retransmit the information code block or perform an error correction directly. 
         [0015]    The monitor code element matrix H is composed of two parts: H=[S         R], in which S indicates a system code element partial matrix in the monitor matrix and R indicates a check code element partial matrix in the monitor matrix. 
         [0016]    In this example, 
         [0000]    
       
         
           
             H 
             = 
             
               
                 [ 
                 
                   
                     
                       1 
                     
                     
                       0 
                     
                     
                       1 
                     
                     
                       ⋮ 
                     
                     
                       1 
                     
                     
                       0 
                     
                     
                       0 
                     
                     
                       0 
                     
                   
                   
                     
                       1 
                     
                     
                       1 
                     
                     
                       1 
                     
                     
                       ⋮ 
                     
                     
                       0 
                     
                     
                       1 
                     
                     
                       0 
                     
                     
                       0 
                     
                   
                   
                     
                       1 
                     
                     
                       1 
                     
                     
                       0 
                     
                     
                       ⋮ 
                     
                     
                       0 
                     
                     
                       0 
                     
                     
                       1 
                     
                     
                       0 
                     
                   
                   
                     
                       1 
                     
                     
                       1 
                     
                     
                       1 
                     
                     
                       ⋮ 
                     
                     
                       0 
                     
                     
                       0 
                     
                     
                       0 
                     
                     
                       1 
                     
                   
                 
                 ] 
               
               . 
             
           
         
       
     
         [0017]    It can be seen that R is a unit matrix 4×4. In this case, when the receiving end performs decoding, it merely needs to form the monitor matrix H according to the system code element partial matrix S and it is judged whether the error occurs to the information code block or not through determining whether the equation H·C T =0 T  is satisfied between the linear block information code block C and the monitor code element matrix H or not. 
         [0018]    In the prior art relevant to the present invention, the channel coding and decoding are realized by utilizing an orthogonal frequency division multiplexing (OFDM) technology. 
         [0019]      FIG. 1  shows an OFDM transfer system. In  FIG. 1 , the transfer system includes a user station (such as a user station  1  or a user station  2 ), an OFDM transfer station and a base station. 
         [0020]      FIG. 2  shows the structure of the OFDM transfer station, which includes an OFDM receiver and an OFDM transmitter. The working principle of the OFDM receiver is shown in  FIG. 3 , the working principle of the OFDM transmitter is shown in  FIG. 4 , and the working principle of the base station is shown in  FIG. 5 . 
         [0021]    The user station  1  and the user station  2 , respectively, transmit the information code blocks U 1  and U 2  to the base station and a transfer station after performing a channel coding, a symbol mapping and an OFDM modulation on the information code blocks U 1  and U 2 . Upon receiving the signal transmitted from the user stations, the transfer station sequentially performs the OFDM demodulation, the symbol demapping and the channel decoding on the signal so as to obtain the information code blocks U 1  and U 2 . The transfer station then performs the channel coding, the symbol mapping and the OFDM modulation on the information code blocks U 1  and U 2  and transfers them to the base station. 
         [0022]    Upon receiving the signal transmitted from the transfer station, the base station respectively performs the OFDM demodulation, the symbol demapping and the channel decoding on the signal so as to obtain the information code blocks. 
         [0023]    As for the transfer technology shown in  FIG. 1 , the path from the user station to the base station and the path from the user station to the base station via the transfer station constitute a path diversity, which enhances the reliability of information transmission. However, only the following two technologies are generally adopted for transmitting the information code block U 1  of the user station  1  to the base station via the transfer station and transmitting the information code block U 2  of the user station  2  to the base station via the transfer station. 
         [0024]    The first technology is that the information code block U 1  and the information code block U 2  from the transfer station to the base station respectively occupy different frequency bands. 
         [0025]    The second technology is that the information code block U 1  and the information code block U 2  from the transfer station to the base station use the same frequency band, but occupy different time periods. 
         [0026]    When the first technology is utilized, there are defects as following: 
         [0027]    A wide spectrum is required. However, the spectrum is a rare resource for operators, so it is intolerable for the operators to waste the spectrum resource to a great extent. 
         [0028]    When the second technology is utilized, although it requires fewer spectrums, each transfer station must be worked in a time-sharing manner, which reduces an average data communication rate of each transfer station. As a result, a throughput of a source node is increased to a rather limited extent or may be even reduced. 
       SUMMARY 
       [0029]    The object of the embodiment of the present invention is to provide an error control method and a cooperative transfer system, which can not only meet a wide spectrum requirement when the transfer station occupies different frequency bands to transmit information code blocks of different user stations to the base station, but also solve the problem of a limited increase or even a decrease of the throughput of the source node when the transfer station uses the same frequency band but occupies different periods of time to transmit the information code blocks of different user stations to the base station, increase the throughput of the transfer system to the utmost extent and further obtain additional cooperative path diversity and linear block code gain. 
         [0030]    The object of the embodiment of the present invention is realized by the following technical solutions: 
         [0031]    An embodiment of the present invention provides an error control method, which includes: 
         [0032]    Each node acting as a transfer node in a cooperative node group codes an acquired distributed information code block to obtain a corresponding distributed check code block and transmits the corresponding distributed check code block to a destination node. 
         [0033]    The destination node combines a received distributed check code block to generate a check code block and combines the distributed information code block transmitted by each node acting as a source node in the cooperative node group to generate an information code block. 
         [0034]    The destination node decoding the check code block and the information code block. The destination node decodes the check code block and the information code block. 
         [0035]    The following technical solutions of the method are optional. 
         [0036]    The coding to obtain the corresponding distributed check code block and transmitting it to the destination node includes the following steps. 
         [0037]    Each node acting as the transfer node in the cooperative node group acquires the distributed information code block transmitted by each node acting as the source node in the cooperative node group; each node acting as the transfer node in the cooperative node group combines the acquired distributed information code block, performs a corresponding distributed linear block coding on the obtained combined information code block after the combination to obtain the corresponding check code block, and transmits the corresponding distributed check code block to the destination node. 
         [0038]    Or each node acting as the transfer node in the cooperative node group acquires the distributed information code block transmitted by each node acting as a source node in the cooperative node group, and the distributed information code block of each node acting as the transfer node in the cooperative node group; each node acting as the transfer node in the cooperative node group combines the acquired distributed information code block, performs a corresponding distributed linear block coding on the obtained information code block after the combination to obtain a check code block corresponding to a whole group composed of each source node, acquires the distributed check code block corresponding to each node acting as the transfer node in the cooperative node group, and transmits the distributed check code block to the destination node. 
         [0039]    Before the coding to obtain the corresponding distributed check code block and transmitting the corresponding distributed check code block to the destination node, the method further includes the following steps: 
         [0040]    Each node acting as the source node in the cooperative node group transmits the distributed information code block to each node acting as the transfer node in the cooperative node group and the destination node. 
         [0041]    The transmitting the distributed information code block includes the following steps: 
         [0042]    When an OFDM subchannel technology is employed, according to different OFDM sub-carrier clusters, an OFDM subchannel is assigned to a broadcast channel from the node acting as the source node in the cooperative node group to a cooperative transfer node group composed of each node acting as the transfer node, and the destination node; each node acting as the source node in the cooperative node group broadcasts the distributed information code block to each node acting as the transfer node and the destination node through different OFDM subchannels. 
         [0043]    When a time division technology is employed, according to different timeslots, a time division subchannel is assigned to a broadcast channel from the node acting as the source node in the cooperative node group to a cooperative transfer node group composed of each node acting as the transfer node in the cooperative node group, and the destination node; each node acting as the source node in the cooperative node group broadcasts the distributed information code block to each node acting as the transfer node and the destination node through different time division subchannels. 
         [0044]    When a code division technology is employed, a spread spectrum code is assigned to a broadcast channel from the node acting as the source node in the cooperative node group to a cooperative transfer node group composed of each node acting as the transfer node in the cooperative node group, and the destination node, according to different spreading codes; each node acting as the source node in the cooperative node group broadcasts the distributed information code block to each node acting as the transfer node and the destination node through the different spread spectrum codes. 
         [0045]    Before the coding to obtain the corresponding distributed check code block and transmitting the corresponding distributed check code block to the destination node, the method further includes the following steps: 
         [0046]    The OFDM subchannel is assigned to a transfer channel from each node acting as the transfer node in the cooperative node group to the destination node according to different OFDM sub-carrier clusters. 
         [0047]    A time division subchannel is assigned the to a transfer channel from each node acting as the transfer node in the cooperative node group to the destination node. 
         [0048]    A spread spectrum code is assigned to a transfer channel from each node acting as the transfer node in the cooperative node group to the destination node. 
         [0049]    The method further includes: acquiring, by the destination node, a monitor matrix corresponding to the cooperative transfer node group composed of each node acting as the transfer node in the cooperative node group. 
         [0050]    When it is required to support dynamic self-adaptive linear block coding, the method further includes the following steps: 
         [0051]    Each node acting as the transfer node in the cooperative node group transmits a distributed monitor matrix, corresponding to each node acting as the transfer node in the cooperative node group, to the destination node; the destination node combines each received distributed monitor matrix to acquire the monitor matrix corresponding to the cooperative transfer node group composed of each node acting as the transfer node. 
         [0052]    When a check code element partial matrix in the monitor matrix corresponding to the cooperative transfer node group composed of each node acting as a transfer node in the cooperative node group is a unit matrix, each node acting as the transfer node in the cooperative node group transmits a distributed system code element partial matrix corresponding to each node acting as the transfer node in the cooperative node group to the destination node; the destination node combines the distributed system code element partial matrix and constructs the monitor matrix corresponding to the cooperative transfer node group according to an obtained system code element partial matrix after the combination. 
         [0053]    The decoding performed by the destination node includes the following steps: 
         [0054]    The destination node combines the received distributed check code block transmitted by each node acting as the transfer node, combines the distributed information code block transmitted by each node acting as the source node in the cooperative node group, and forms a linear packet code block according to the obtained check code block and information code block after the combination. 
         [0055]    The linear packet code block is decoded according to the monitor matrix corresponding to the cooperative transfer node group composed of each node acting as the transfer node. 
         [0056]    The embodiment of the present invention further provides a cooperative transfer system for error control, which includes a cooperative node group and a destination node. 
         [0057]    The cooperative node group is adapted to code a distributed information code block acquired by each code acting as a transfer node in the cooperative node group to obtain a corresponding distributed check code block, and transmit the corresponding distributed check code block to the destination node. The destination node is adapted to combine the received distributed check code block, combine the distributed information code block transmitted by each node acting as a source node in the cooperative node group, and decode a generated check code block and a generated information code block after the combination. 
         [0058]    The following technical solutions of the system are optional: 
         [0059]    The transfer node in the cooperative node group includes a receiver and a transmitter. 
         [0060]    The receiver is adapted to perform a channel decoding process on the received distributed information code block transmitted by each source node after successively performing a demodulating process and a symbol demapping process on the received distributed information code block, and transmit a processed distributed information code block to the transmitter 
         [0061]    The transmitter is adapted to acquire the distributed information code block transmitted by the source node, or acquire the distributed information code block transmitted by the source node and the distributed information code block of the transmitter, perform a distributed linear block coding process after combining the obtained distributed information code block, and send out a processed distributed check code block after successively performing the symbol mapping process and a modulating process on an obtained corresponding distributed check code block; or perform a linear block coding process on an obtained information code block after the combination to obtain the corresponding check code block, and send out a processed distributed check code block after successively performing the corresponding symbol mapping process and the modulating process on the distributed check code block corresponding to the transmitter. 
         [0062]    The receiver includes a demodulator, a symbol demapping unit and a channel decoding unit. 
         [0063]    The demodulator is adapted to demodulate the received distributed information code block and transmit the demodulated distributed information code block to the symbol demapping unit. The symbol demapping unit is adapted to perform the symbol demapping process on the received distributed information code block and transmit a demapped distributed information code block to the channel decoding unit to perform the channel decoding process. 
         [0064]    The transmitter includes a distributed linear block coding unit or a linear block coding unit. 
         [0065]    The distributed linear block coding unit is adapted to combine the received distributed information code block transmitted by each source node, or combine the received distributed information code block transmitted by each source node with the distributed information code block of the transmitter, perform a distributed linear block coding process on the obtained information code block after the combination to obtain the corresponding distributed check code block, and send out the distributed check code block. 
         [0066]    The linear block coding unit is adapted to combine the received distributed information code block transmitted by each source node, or combine the received distributed information code block transmitted by each source node with the distributed information code block of the transmitter, perform a distributed linear block coding process on the obtained information code block after the combination to obtain the corresponding check code block, and send out the distributed check code block corresponding to the transmitter. 
         [0067]    The transmitter further includes a symbol mapping unit and a modulator. 
         [0068]    The symbol mapping unit is adapted to perform the corresponding symbol mapping process on the distributed check code block transmitted by the distributed linear block coding unit or the linear block coding unit, transmit a mapped distributed check code block to the modulator, and send out after a corresponding modulating process. 
         [0069]    The destination node includes a broadcast channel decoding unit and a transfer channel decoding unit. 
         [0070]    The broadcast channel decoding unit is adapted to perform a channel decoding process on the distributed information code block broadcasted by each cooperative node and received by the destination node at the broadcasting stage, combine the decoded distributed information code block, output an estimated value of the information code block, and transmit the estimated value of the information code block to the transfer channel decoding unit. 
         [0071]    The transfer channel decoding unit is adapted to combine the distributed check code block transmitted by each transfer node in the cooperative node group and received by the destination node at the transferring stage, and decode an obtained check code block after the combination and the estimated value of the received information code block. 
         [0072]    The destination node further includes a demodulator and a symbol demapping unit. 
         [0073]    The demodulator is adapted to demodulate the distributed information code block broadcasted by each node in the cooperative node group and received by the destination node at the broadcasting stage and/or the distributed check code block transmitted by each transfer node in the cooperative node group and received by the destination node at the transferring stage; and the symbol demapping unit is adapted perform the corresponding symbol demapping process on the processed distributed information code block and/or distributed check code block, transmit the distributed information code element to the broadcast channel decoding unit and transmit the distributed check code element to the transfer channel decoding unit. 
         [0074]    The demodulator includes an OFDM demodulator, and the modulator includes an OFDM modulator. 
         [0075]    It can be known from the technical solutions of the embodiment of the present invention that, in the embodiment of the present invention, each node acting as the transfer node in the cooperative node group codes the obtained distributed information code block to obtain the corresponding distributed check code block and transmits it to the destination node. The destination node combines the received distributed check code blocks and combines the distributed information code block transmitted by each node acting as the source node in the cooperative node group and decodes the combined check code block and information code block. The invention enables the XOR operation on the information code block transmitted by each node in the cooperative node group during the linear block coding, so that the information code blocks of the different user stations can be transmitted to the base station in the same frequency band and the same period of time. Therefore, the embodiment of the present invention can meet the wide spectrum requirement when the transfer station occupies different frequency bands to transmit information code blocks of different user stations, solve the problem of the limited increase or even the decrease of the throughput of the source node when the transfer station uses the same frequency band but occupies different periods of time to transmit information code blocks of different user stations to the base station, increase the throughput of the transfer system farthest, and further obtain additional cooperative path diversity and linear block code gain. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0076]      FIG. 1  is a working principle diagram illustrating the OFDM transfer system; 
           [0077]      FIG. 2  is a schematic diagram illustrating the structure of the OFDM transfer station; 
           [0078]      FIG. 3  is a working principle diagram illustrating the receiver in the OFDM transfer station; 
           [0079]      FIG. 4  is a working principle diagram illustrating the transmitter in the OFDM transfer station; 
           [0080]      FIG. 5  is a schematic working principle diagram illustrating the base station; 
           [0081]      FIG. 6  is a schematic diagram illustrating a cooperative transfer system model in accordance with a first embodiment of the present invention; 
           [0082]      FIG. 7  is a schematic diagram illustrating a second cooperative transfer system model in accordance with a first embodiment of the present invention; 
           [0083]      FIG. 8  is a schematic working principle diagram illustrating the transmitter in accordance with a first embodiment the present invention; 
           [0084]      FIG. 9  is a schematic working principle diagram illustrating the destination node in accordance with a first embodiment the present invention; 
           [0085]      FIG. 10  is a schematic diagram illustrating an implementation model in a cooperative transfer system in accordance with a first embodiment of the present invention; 
           [0086]      FIG. 11  is a flow chart illustrating a third embodiment of the present invention; 
           [0087]      FIG. 12  is a schematic diagram illustrating each node in the cooperative node group transmitting information to the destination node by using an OFDM technology; 
           [0088]      FIG. 13  is a schematic diagram illustrating each node in the cooperative node group transmitting the information to the destination node by using a time division technology; and 
           [0089]      FIG. 14  is a schematic view illustrating each node in the cooperative node group transmitting the information to the destination node by using a code division technology. 
       
    
    
     DETAILED DESCRIPTION 
       [0090]    An embodiment of the present invention provides an error control method and a cooperative transfer system, which utilizes a distributed linear block code technology to support a cooperative access of each node in the cooperative transfer node group to the same base station. 
         [0091]      FIG. 6  shows a system in accordance with a first embodiment of the present invention, and the system includes the cooperative node group and the destination node. A communication target of the cooperative node group is the destination node. Each node in the cooperative node group, such as a node  1 , a node  2 , . . . , and a node N, may act as an information source node (referred to as the source node for short), all the other nodes may act as the transfer node or a part of them may act as the transfer node. Therefore, the nodes which act as the transfer node may be the node  2 , . . . , and the node M, and M≦N. All the transfer nodes compose the cooperative transfer node group. 
         [0092]    Assume that the node  1  acts as the source node; the system model shown in  FIG. 7  is formed. Each node in a dashed frame is the transfer node which composes the cooperative transfer node group. In addition to a direct communication channel, a plurality of transfer nodes act as communication channels for parallel cooperative transfer between the source node and the destination node. 
         [0093]    Each source node broadcasts the distributed information code block to each transfer node. 
         [0094]    Each transfer node has a similar structure as the structure shown in  FIG. 2 , which includes the receiver, the transmitter and a transceiver antenna. The transceiver antenna may be one or more. 
         [0095]    The receiver successively processes the received distributed information code block and transmits it to the transmitter. The transmitter processes the received distributed information code block and sends it out. 
         [0096]    The receiver has a similar structure as the structure shown in  FIG. 3 , which includes the demodulator, the symbol demapping unit and the channel decoding unit. 
         [0097]    The demodulator is an OFDM demodulator, which demodulates the received information code block and transmits the demodulated information code block to the symbol demapping unit. The symbol demapping unit performs the symbol demapping process on the received information code block and transmits processed signal to the channel decoding unit. The channel decoding unit is a normal channel decoding unit adapted to perform the channel decoding process at the transferring stage. 
         [0098]    The structure of the transmitter is shown in  FIG. 8 , which includes the distributed linear block coding unit, the symbol mapping unit and the modulator. The modulator is the OFDM modulator. 
         [0099]    The distributed linear block coding unit is a critical inventive feature of the embodiment of the present invention, which is adapted to combine the received distributed information code block transmitted by each source node, perform the distributed linear block coding process on the combined information code block to obtain the corresponding distributed check code block, and send out the distributed check code block. 
         [0100]    When the transfer node in the cooperative node group is used as both the source node and the transfer node, the working principle of the distributed linear block coding unit in the transfer node is given as follows: 
         [0101]    The distributed linear block coding unit combines the received distributed information code block transmitted by each source node with the distributed information code block of the distributed linear block coding unit, performs the distributed linear block coding process on the combined information code block to obtain the corresponding distributed check code block and sends out the distributed check code block. 
         [0102]    The symbol mapping unit performs the symbol mapping process on the distributed check code block transmitted by the distributed block coding unit, transmits it to the modulator for a corresponding modulating process, and sends it out. 
         [0103]    The structure of the destination node receiver is shown in  FIG. 9 , which includes the demodulator, the symbol demapping unit, the broadcast channel decoding unit and the transfer channel decoding unit. The demodulator is the OFDM demodulator. 
         [0104]    When the broadcast channel decoding unit is at the running status, i.e., at a broadcasting stage, the demodulator demodulates the distributed information code block broadcasted by each source node and received by the destination node, and transmits the processed distributed information code block to the symbol demapping unit. The symbol demapping unit merely performs the symbol demapping process on the distributed information code block output to the broadcast channel decoding unit, and then transmits it to the broadcast channel decoding unit. 
         [0105]    The broadcast channel decoding unit decodes the processed distributed information code block after receiving it, combines the received distributed information code block with the distributed information code block of the broadcast channel decoding unit, performs the channel decoding process on the combined information code block, outputs the estimated value of the information code block, and transmits it to the transfer channel decoding unit. 
         [0106]    When the transfer channel decoding unit is at the running status, i.e., at the transferring stage, the demodulator demodulates the distributed check code block transmitted by each transfer node and received by the destination node, transmits the processed distributed check code block to the symbol demapping unit, and outputs the estimated value of the distributed check code block to the transfer channel decoding unit. The transfer channel decoding unit combines the estimated values of the distributed check code block, combines the estimated values with the estimated values of the information code blocks output by the broadcast channel decoding unit and performs the channel decoding process to obtain the information code block corresponding to the whole node group composed of each source node. 
         [0107]    Hereinafter, with reference to the implementation model of the cooperative transfer system shown in  FIG. 10 , the specific working process of the above-mentioned embodiment is illustrated in detail: 
         [0108]    Assume that a user station  1 , a user station  2  and a user station  3  may all act as the source nodes, and the user station  1 , the user station  2  and the user station  3  compose the cooperative node group. The user station  2  and the user station  3  may also act as transfer nodes of the user station  1 , and the user station  2  and the user station  3  compose the cooperative transfer node group. The cooperative node group and the destination node (the base station shown in  FIG. 10 ) compose the cooperative transfer system. The communication target of the cooperative node group composed of each source node is the destination node. 
         [0109]    Assume that the cooperative node group adopts a (7, 3) linear block code. 
         [0110]    The distributed input information code blocks of the user station  1 , the user station  2  and the user station  3  are respectively: 
         [0000]      U 1 =u 0 , U 2 =u 1 , U 3 =u 2    
         [0111]    At the broadcasting stage, the user station  1 , the user station  2  and the user station  3  respectively act as the source nodes to broadcast corresponding distributed information code blocks U 1 , U 2 , and U 3  to the transfer nodes (the user station  2  and the user station  3 ) in the cooperative transfer node group and the destination node. 
         [0112]    At the transferring stage, the user station  2  and the user station  3  combine the received distributed information code blocks with its information code blocks into the following information code block: 
         [0000]      U=[u 0  u 1  u 2 ] 
         [0113]    The user station  2  and the user station  3  perform the distributed linear block coding process on the information code block U according to the following equation: 
         [0000]    
       
      
       P 
       i 
       =U·Q 
       i  
      
     
         [0114]    Q i (i=1,2) is the distributed check code element partial matrix of the cooperative transfer node (i.e., the user station  2  and the user station  3 ). Q 1  (i.e., the distributed check code element partial matrix of the user station  2 ) is composed of code elements in the first and second columns of the check code element partial matrix Q of the generated matrix G. Q 2  (i.e., the distributed check code element partial matrix of the user station  3 ) is composed of code elements in the third and fourth columns of the check code element partial matrix Q of the generated matrix G. 
         [0115]    The distributed check code blocks output after being coded are: 
         [0000]    
       
         
           
             
               
                 P 
                 1 
               
               = 
               
                 [ 
                 
                   
                     p 
                     0 
                   
                    
                   
                       
                   
                    
                   
                     p 
                     1 
                   
                 
                 ] 
               
             
             , 
             
               
 
             
              
             
               
                 P 
                 2 
               
               = 
               
                 [ 
                 
                   
                     p 
                     2 
                   
                    
                   
                       
                   
                    
                   
                     p 
                     3 
                   
                 
                 ] 
               
             
           
         
       
       
         
           
             wherein 
             , 
             
               
 
             
              
             
               { 
               
                 
                   
                     
                       
                         
                           p 
                           0 
                         
                         = 
                         
                           
                             u 
                             0 
                           
                           ⊕ 
                           
                             u 
                             2 
                           
                         
                       
                     
                   
                   
                     
                       
                         
                           p 
                           1 
                         
                         = 
                         
                           
                             u 
                             0 
                           
                           ⊕ 
                           
                             u 
                             1 
                           
                           ⊕ 
                           
                             u 
                             2 
                           
                         
                       
                     
                   
                   
                     
                       
                         
                           p 
                           2 
                         
                         = 
                         
                           
                             u 
                             0 
                           
                           ⊕ 
                           
                             u 
                             1 
                           
                         
                       
                     
                   
                   
                     
                       
                         
                           p 
                           3 
                         
                         = 
                         
                           
                             u 
                             1 
                           
                           ⊕ 
                           
                             u 
                             2 
                           
                         
                       
                     
                   
                 
                 , 
               
             
           
         
       
     
         [0116]    The distributed check code blocks are transmitted to the destination node after being processed by the symbol mapping unit and the demodulator. 
         [0117]    The base station performs the decoding process according to the distributed information code block received at the broadcasting stage and the distributed check code block received at the transferring stage. The detailed process is given below: 
         [0118]    At the broadcasting stage, the base station demodulates the received distributed information code block broadcasted by each source node in the cooperative node group through the demodulator and transmits the processed distributed information code block to the symbol demapping unit. The symbol demapping unit merely performs the symbol demapping process on the distributed information code block output to the broadcast channel decoding unit and transmits it to the broadcast channel decoding unit. The broadcast channel decoding unit combines the processed distributed information code block after receiving it, performs the channel decoding process on the combined information code block, outputs the estimated value of the information code block, and transmits it to the transfer channel decoding unit. 
         [0119]    At the transferring stage, the demodulator demodulates the received distributed check code block transferred by each transfer node in the cooperative transfer node group, transmits the processed distributed check code block to the symbol demapping unit, and outputs the estimated value of the distributed check code block to the transfer channel decoding unit. 
         [0120]    The transfer channel decoding unit combines the estimated value of the distributed check code block, combines the estimated value with the estimated value of the information code block output by the broadcast channel decoding unit, and performs the channel decoding process based on a pre-acquired monitor matrix H to obtain the information code block. 
         [0121]    For example, assume that the monitor matrix H pre-acquired by the destination node is: 
         [0000]    
       
         
           
             H 
             = 
             
               
                 [ 
                 
                   
                     
                       1 
                     
                     
                       0 
                     
                     
                       1 
                     
                     
                       ⋮ 
                     
                     
                       1 
                     
                     
                       0 
                     
                     
                       0 
                     
                     
                       0 
                     
                   
                   
                     
                       1 
                     
                     
                       1 
                     
                     
                       1 
                     
                     
                       ⋮ 
                     
                     
                       0 
                     
                     
                       1 
                     
                     
                       0 
                     
                     
                       0 
                     
                   
                   
                     
                       1 
                     
                     
                       1 
                     
                     
                       0 
                     
                     
                       ⋮ 
                     
                     
                       0 
                     
                     
                       0 
                     
                     
                       1 
                     
                     
                       0 
                     
                   
                   
                     
                       1 
                     
                     
                       1 
                     
                     
                       1 
                     
                     
                       ⋮ 
                     
                     
                       0 
                     
                     
                       0 
                     
                     
                       0 
                     
                     
                       1 
                     
                   
                 
                 ] 
               
               . 
             
           
         
       
     
         [0122]    The base station performs the linear block decoding process on the received information code block according to the acquired monitor matrix H so as to obtain the information code block U=[u 0  u 1  u 2 ] of the cooperative node group. 
         [0123]    As for the system of the embodiment of the present invention, a second embodiment of the present invention is provided, which is different from the first embodiment in that the distributed linear block coding unit shown in  FIG. 8  is replaced with the linear block coding unit. Information processing procedures of the linear block coding unit are given as below: 
         [0124]    After combining the received distributed information code block with its distributed information code block, the linear block coding unit performs the linear block coding process so as to obtain the check code block corresponding to the whole group composed of each source node, and transmits it the destination node after successively performing the corresponding symbol mapping process and the corresponding modulating process on the part of the distributed check code block corresponding to the linear block coding unit. 
         [0125]    The cooperative transfer system shown in  FIG. 10  is still taken as the example to illustrate the information processing procedures of the linear block coding unit: 
         [0126]    Assume that the cooperative node group adopts the (7, 3) linear block code. 
         [0127]    The distributed input information code blocks of the user station  1 , the user station  2  and the user station  3  are respectively: 
         [0000]      U 1 =u 0 , U 2 =u 1 , U 3 =u 2 . 
         [0128]    At the broadcasting stage, the user station  1 , the user station  2  and the user station  3  respectively act as the source node to broadcast the corresponding distributed information code blocks U 1 , U 2 , and U 3  to the transfer nodes (the user station  2  and the user station  3 ) in the cooperative transfer node group and the destination node. 
         [0129]    At the transferring stage, the user station  2  and the user station  3  combine the received distributed information code blocks with its information code blocks of the user stations  2  and  3  into the following information code block: 
         [0000]      U=[u 0  u 1  u 2 ] 
         [0130]    The user station  2  and the user station  3  perform the linear block coding process respectively on the information code block U according to the following equation: 
         [0131]    P=U·Q In the equation, Q is the check code element partial matrix of the transfer node (the user station  2  or the user station  3 ): 
         [0000]    
       
         
           
             Q 
             = 
             
               
                 [ 
                 
                   
                     
                       1 
                     
                     
                       1 
                     
                     
                       1 
                     
                     
                       0 
                     
                   
                   
                     
                       0 
                     
                     
                       1 
                     
                     
                       1 
                     
                     
                       1 
                     
                   
                   
                     
                       1 
                     
                     
                       1 
                     
                     
                       0 
                     
                     
                       1 
                     
                   
                 
                 ] 
               
               . 
             
           
         
       
     
         [0132]    A corresponding check code block P is obtained according to the above equation. The user station  2  and the user station  3  merely transfer the distributed check code block Pi (i=, . . . , and M; M≦N) in the check code block P corresponding to the user stations  2  and  3  to the destination node. 
         [0133]    The distributed check code blocks output by the user station  2  and the user station  3  are, respectively: 
         [0000]    
       
         
           
             
               
                 P 
                 1 
               
               = 
               
                 [ 
                 
                   
                     p 
                     0 
                   
                    
                   
                       
                   
                    
                   
                     p 
                     1 
                   
                 
                 ] 
               
             
             , 
             
               
 
             
              
             
               
                 P 
                 2 
               
               = 
               
                 [ 
                 
                   
                     p 
                     2 
                   
                    
                   
                       
                   
                    
                   
                     p 
                     3 
                   
                 
                 ] 
               
             
           
         
       
       
         
           
             wherein 
             , 
             
               
 
             
              
             
               { 
               
                 
                   
                     
                       
                         
                           p 
                           0 
                         
                         = 
                         
                           
                             u 
                             0 
                           
                           ⊕ 
                           
                             u 
                             2 
                           
                         
                       
                     
                   
                   
                     
                       
                         
                           p 
                           1 
                         
                         = 
                         
                           
                             u 
                             0 
                           
                           ⊕ 
                           
                             u 
                             1 
                           
                           ⊕ 
                           
                             u 
                             2 
                           
                         
                       
                     
                   
                   
                     
                       
                         
                           p 
                           2 
                         
                         = 
                         
                           
                             u 
                             0 
                           
                           ⊕ 
                           
                             u 
                             1 
                           
                         
                       
                     
                   
                   
                     
                       
                         
                           p 
                           3 
                         
                         = 
                         
                           
                             u 
                             1 
                           
                           ⊕ 
                           
                             u 
                             2 
                           
                         
                       
                     
                   
                 
                 . 
               
             
           
         
       
     
         [0134]    The corresponding symbol mapping process and modulating process are performed on P 1  and P 2  in turn and the processed P 1  and P 2  are transmitted to the destination node. 
         [0135]    As for the method of the embodiment of the present invention, the embodiment of the present invention provides a third embodiment as shown in  FIG. 11 . 
         [0136]    Block  101 : Each node acting as the source node in the cooperative node group transmits the distributed information code block to each node acting as the transfer node in the cooperative node group and the destination node. 
         [0137]    Each node in the cooperative node group may act as the source node. When one node in the cooperative node group acts as the source node, other nodes or part of other nodes in the cooperative node group may act as the transfer nodes of the source node and compose the cooperative transfer node group. At the broadcasting stage, each node acting as the source node j (j=1, . . . , and N) broadcasts the distributed information code block Uj (j=1, . . . , and N) to each transfer node in the cooperative transfer node group and the destination node. Therefore, the input information code block of a node group composed of each source node is: 
         [0000]      U=[U 1  U 2  U N ], 
         [0138]    In the above code block, a total code element bit number in U is k. A linear packet code block C having the total code element bit number of n may be formed according to U based on the following equation: 
         [0139]    C=U·G In the equation, G is a k×n generated matrix and includes two parts: G=[M         Q]. M is the information code element matrix in the generated matrix G and Q is a k×(n−k) check code element matrix in the generated matrix G. 
         [0140]    After each node acting as the source node in the cooperative node group transmits the information code block to the destination node, the destination node obtains the linear packet code block C composed of each source node. 
         [0141]    Block  102 : Each transfer node in the cooperative node group receives the distributed information code block transmitted by each source node in the group, combines it with the distributed information code block of each transfer node, performs the distributed linear block coding process, obtains the corresponding distributed check code block, and transmits it to the destination node. 
         [0142]    At the transferring stage, each transfer node i (i=1, . . . , M; M≦N) in the cooperative transfer node group combines the received information code block transmitted by each source node with the information code block of each transfer node so as to form the input information code block of the group composed of each source node: 
         [0000]      U=[U 1  U 2  U N ]. 
         [0143]    A distributed linear block coding process is performed on U based on the following equation: 
         [0000]        P   i   =U·Q   i . 
         [0144]    Qi is a distributed k×Ti check code element partial matrix of the transfer node i (i=1, . . . , and M; M≦N). Qi is composed of Ti columns code elements from column (T 1 +T 2 + . . . +Ti−1+1) to column (T 1 +T 2 + . . . +Ti) of the check code element partial matrix Q in the generated matrix G and T 0 =0. 
         [0145]    The distributed check code block P i  (i=1, . . . , and M; M≦N) corresponding to each transfer node is obtained based on the above equation. The code element bit number of Pi is Ti and n−k=T 1 +T 2 + . . . +TM. 
         [0146]    The distributed check code block Pi is transferred to the destination node. Therefore, the destination node may obtain the check code block corresponding to the whole group composed of each source node: 
         [0000]      P=[P 1  P 2  . . . P M ]. 
         [0147]    In order to decrease communication traffic at the transferring stage, a low-density parity check code (LDPC) may be selected for the distributed channel coding process. 
         [0148]    Block  103 : The destination node combines the received distributed check code block transmitted by each transfer node, combines the distributed information code block transmitted by each source node during the broadcasting stage and forms the linear packet code block based on the combined check code block and information code block. The destination node decodes the linear packet code block according to the monitor matrix corresponding to the cooperative node group composed of each transfer node. 
         [0149]    Before this step, the destination node needs to acquire the monitor matrix corresponding to the cooperative transfer node group composed of each transfer node. The specified acquiring method may be realized through an agreement with the cooperative transfer node group via an initialization process or through the information exchanged with the cooperative transfer node group. 
         [0150]    When it is required to support the dynamic self-adaptive linear block coding, each transfer node transmits its corresponding monitor matrix to the destination node. The destination node combines the received monitor matrix corresponding to each transfer node, and acquires the monitor matrix corresponding to the whole group composed of each transfer node. 
         [0151]    Assume that the distributed Ti×n monitor matrix corresponding to each transfer node i (i=1, . . . , and M; M≦N) is Hi, which is composed of Ti columns of code elements from column (T 1 +T 2 + . . . +Ti−1+1) to column (T 1 +T 2 + . . . +Ti) of the monitor matrix H. The destination node combines the monitor matrix Hi corresponding to each transfer node after receiving it so as to generate the monitor matrix H corresponding to the whole group composed of each transfer node. 
         [0152]    When the check code element partial matrix in the monitor matrix is the unit matrix, each transfer node transmits the corresponding system code element partial matrix to the destination node. The destination node combines the system code element partial matrix and constructs the monitor matrix corresponding to the whole group composed of each transfer node according to the combined system code element partial matrix. 
         [0153]    Assume that the distributed Ti×k system code element partial matrix of each transfer node i (i=1, . . . , and M; M≦N) is Si, which is composed of Ti columns code elements from column (T 1 +T 2 + . . . +Ti−1+1) to column (T 1 +T 2 + . . . +Ti) of the system code element partial matrix S of the monitor matrix H. The destination node combines the distributed Tixk system code element partial matrix Si corresponding to each transfer node after receiving it so as to generate the system code element partial matrix S corresponding to the whole group composed of each transfer node. The destination node constructs the monitor matrix H corresponding to the whole group composed of each transfer node according to the combined system code element partial matrix S. The destination node decodes the obtained linear packet code block C and check code block P according to the monitor matrix H so as to obtain the information code block U corresponding to the whole group composed of each source node after the error detection or the error correction. 
         [0154]    Hereinafter, based on the OFDM subchannel technology, the time division technology and the code division technology, the detailed implementation processes of Block  101  and Block  102  in the third embodiment are illustrated: 
         [0155]    When the OFDM subchannel technology is adopted, the detailed implementation processes of Step  101  and Step  102  in the third embodiment are given below. 
         [0156]    As shown in  FIG. 12 , assume that the OFDM channel is divided into orthogonal OFDM subchannels  1  . . . N according to different OFDM sub-carrier clusters i (i=1, . . . , and N). 
         [0157]    In Block  101 , at the broadcasting stage, according to different OFDM sub-carrier clusters, the OFDM subchannel j (j=1, . . . , and N) is assigned to the broadcast channel from each source node j in the cooperative node group to each transfer node in this group, and the destination node. Each source node j (j=1, . . . , and N) in the cooperative node group respectively broadcasts the distributed information code block Uj (j=1, . . . , and N) to each transfer node in the cooperative node group and the destination node through different OFDM subchannels. 
         [0158]    In Block  102 , at the transferring stage, according to different OFDM sub-carrier clusters, the OFDM subchannel i (i=1, . . . , and M) is assigned to the transfer channel from each transfer node i in the cooperative node group to the destination node. Each transfer node i (i=1, . . . , and M; M≦N) in the cooperative node group receives the distributed information code block transmitted by each source node in this group, combines the distributed information code block with the distributed information code block of the transfer node, performs the distributed linear block coding process so as to obtain a corresponding check code block Pi (i=1, . . . , and M; M≦N), and transmits it to the destination node through the assigned transfer channels. 
         [0159]    When the time division technology is adopted, the detailed implementation processes of Block  101  and Block  102  in the third embodiment are given below: 
         [0160]    As shown in  FIG. 13 , assume that the communication channel is divided into an orthogonal time division subchannels  1  . . . N according to different timeslots i (i=1, . . . , and N). 
         [0161]    In Block  101 , at the broadcasting stage, according to different timeslots i (i=1, and N), a time division subchannel j (j=1, . . . , and N) is assigned to the broadcast channel from each source node j in the cooperative node group to each transfer node in this group and the destination node. Each source node j (j=1, . . . , and N) in the cooperative node group broadcasts the distributed information code block Uj (j=1, . . . , and N) to each transfer node in the cooperative node group and the destination node through different time division subchannels. 
         [0162]    In Block  102 , at the transferring stage, a time division subchannel i (i=1, . . . , and M) is assigned to the transfer channel from each transfer node i (i=1, . . . , and M; M≦N) in the cooperative node group to the destination node. Each transfer node i (i=1, . . . , and M; M≦N) in the cooperative node group receives the distributed information code block transmitted by each source node in this group, combines the distributed information code block with the distributed information code block of the transfer node, performs the distributed linear block coding process so as to obtain a corresponding check code block Pi (i=1, . . . , and M; M≦N), and transmits it to the destination node through the assigned transfer channels. 
         [0163]    When the code division technology is adopted, the detailed implementation processes of Block  101  and Block  102  in the third embodiment are given below. 
         [0164]    As shown in  FIG. 14 , assume that the communication channel is divided into an orthogonal spread spectrum subchannels  1  . . . N according to different spreading codes i (i=1, . . . , and N). 
         [0165]    In Block  101 , at the broadcasting stage, according to different spreading codes, a spreading code j (j=1, . . . , and N) is assigned to the broadcast channel from each source node j in the cooperative node group to each transfer node in this group and the destination node. Each source node j (j=1, . . . , and N) in the cooperative node group broadcasts the distributed information code block Uj (j=1, . . . , and N) to each transfer node in the cooperative node group and the destination node through different spreading codes. 
         [0166]    In Block  102 , at the transferring stage, a spreading code i (i=1, . . . , and M) is assigned to the transfer channel from each transfer node i in the cooperative node group to the destination node. Each transfer node i (i=1, . . . , and M; M≦N) in the cooperative node group receives the distributed information code block transmitted by each source node in this group, combines the distributed information code block with the distributed information code block of the transfer node, performs the distributed linear block coding process so as to obtain a corresponding check code block Pi (i=1, . . . , and M; M≦N), and transmits it to the destination node through the assigned transfer channels. 
         [0167]    As for the method of the embodiment of the present invention, the embodiment of the present invention provides a fourth embodiment, which is different from the third embodiment in Block  102 . The detailed implementation procedures of Block  102  in the fourth embodiment are given below: 
         [0168]    Each transfer node in the cooperative node group receives the distributed information code block transmitted by each source node in this group, combines the distributed information code block with its distributed information code block, performs the linear block coding to obtain the check code block corresponding to the whole group composed of each source node, and transmits the corresponding distributed check code block of the transfer node itself to the destination node. 
         [0169]    At the transferring stage, each transfer node i (i=1, . . . , and M; M≦N) in the cooperative transfer node group combines the received distributed information code block transmitted by the source node with its distributed information code block so as to form the input information code block of the group composed of each source node: 
         [0000]      U=[U 1  U 2  U N ]. 
         [0170]    The linear block coding process is performed according to the following equation: 
         [0000]    
       
      
       P 
       i 
       =U·Q.  
      
     
         [0171]    Q is a distributed k×Ti check code element partial matrix of the transfer node i (i=1, . . . , M; M≦N). Q is composed of the check code element partial matrix Q of the generated matrix G. 
         [0172]    Each transfer node transfers the distributed check code block Pi (i=1, . . . , and M; M≦N) responding to itself to the destination node. The code element bit number of Pi is Ti, and n−k=T 1 +T 2 + . . . +TM. 
         [0173]    The destination node may obtain the check code block corresponding to the whole group composed of each source node according to Pi transmitted by the source node: 
         [0000]      P=[P 1 P 2 P M ]. 
         [0174]    In the third embodiment of the present invention, when the transfer node merely has a transferring function but may not act as the source node, the implementation process of Block  102  is given below: 
         [0175]    Each transfer node in the cooperative node group combines the distributed information code block transmitted by each source node in this group after receiving it, performs the corresponding distributed linear block coding to obtain the distributed check code block, and transmits it to the destination node. 
         [0176]    In the fourth embodiment of the present invention, when the transfer node merely has the transferring function but may not act as the source node, the implementation process of Block  102  is given below. 
         [0177]    Each transfer node in the cooperative node group combines the distributed information code block transmitted by each source node in this group after receiving it, performs the corresponding linear block coding to obtain the check code block corresponding to the whole group composed of each source node, and transmits the distributed check code block corresponding to the transfer node itself to the destination node. 
         [0178]    Though illustration and description of the present disclosure have been given with reference to preferred embodiments thereof, it should be appreciated by persons of ordinary skill in the art that various changes in forms and details can be made without deviation from the spirit and scope of this disclosure, which are defined by the appended claims.