Name
Abstract | ||
|---|---|---|
We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which the combinatorial representation in the form of a graph can be obtained by standard procedures. |
Year | Venue | Keywords |
|---|---|---|
2001 | ICALP | standard procedure,minimal tail-biting trellis,combinatorial representation,minimal tail-biting trellises,practical subclass,linear cyclic code,generator matrix,certain cyclic block codes,simple algorithm,chemical engineering,cyclic code,block codes,reed solomon code |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Generator matrix,Computer science,Polynomial code,Block code,Cyclic code,Reed–Solomon error correction,Linear code,Reed–Muller code,Prefix code | Conference | 2076 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-42287-0 | 4 |
PageRank | References | Authors |
0.49 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Priti Shankar | 1 | 138 | 16.27 |
| P. N. A. Kumar | 2 | 6 | 0.98 |
| Harmeet Singh | 3 | 26 | 4.77 |
| B. Sundar Rajan | 4 | 1517 | 157.26 |