Changeset 24f6cd9 in git
- Timestamp:
- Oct 22, 2008, 3:31:48 PM (15 years ago)
- Branches:
- (u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')
- Children:
- 911fd66b45e1a1ccd03ce8c4f2ab7b1743b7e5d5
- Parents:
- 3599e9a9670f65c6c372f62243e64c8b235cf959
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/LIB/decodegb.lib
r3599e9 r24f6cd9 1 1 /////////////////////////////////////////////////////////////////////////////// 2 version="$Id: decodegb.lib,v 1. 7 2008-10-20 17:21:36bulygin Exp $";2 version="$Id: decodegb.lib,v 1.8 2008-10-22 13:31:48 bulygin Exp $"; 3 3 category="Coding theory"; 4 4 info=" … … 104 104 THEORY: Based on 'defset' of the given cyclic code, the procedure constructs 105 105 the corresponding Cooper-Reed-Heleseth-Truong ideal 'crht'. With its 106 help one can solve the decoding problem. For basics of the method @ref{Co pper philosophy}.106 help one can solve the decoding problem. For basics of the method @ref{Cooper philosophy}. 107 107 SEE ALSO: sysNewton, sysBin 108 108 EXAMPLE: example sysCRHT; shows an example … … 209 209 the corresponding Cooper-Reed-Heleseth-Truong ideal 'crht_md'. With 210 210 its help one can find minimum distance of the code in the binary 211 case. For basics of the method @ref{Co pper philosophy}.211 case. For basics of the method @ref{Cooper philosophy}. 212 212 EXAMPLE: example sysCRHTMindist; shows an example 213 213 " … … 296 296 the corresponding ideal 'newton' with the generalized Newton 297 297 identities. With its help one can solve the decoding problem. For 298 basics of the method @ref{Co pper philosophy}.298 basics of the method @ref{Cooper philosophy}. 299 299 SEE ALSO: sysCRHT, sysBin 300 300 EXAMPLE: example sysNewton; shows an example
Note: See TracChangeset
for help on using the changeset viewer.