Irregularly graphed encoding technique

A method of encoding a message including a plurality of data items, includes identifying maximum and minimum numbers of first edges to be associated with data items. A first distribution of different numbers of first edges, ranging from the maximum to the minimum number of first edges, to be associated with the data items is computed. A first associated number of first edges, within the range, is established for each data item, the different numbers of first edges being associated with the data items according to the computed first distribution. A maximum and minimum number of second edges to be associated with redundant data items are identified. A second distribution of numbers of second edges, ranging from the maximum to the minimum number of second edges, to be associated with the redundant data items is computed. An associated number of second edges, within the range, is established for each redundant data item, the different numbers of second edges being associated with the redundant data items according to the determined second distribution. A threshold number of potentially lost/corrupted data items is established. An encoded message is formed with the redundant data items associated with the data items according to the first distribution and with the data items associated with the redundant data items according to the second distribution only if the number of data items which are recoverable or correctable exceeds the threshold.


Année
2000
Mots-clefs:
Autres identifiants:
EPO Family ID: 25510207
Numéro(s) de brevet :
Laboratoires:




 Notice créée le 2016-12-08, modifiée le 2019-03-17

Lien externe:
Télécharger le document
URL
Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)