Suchergebnisse
UB Katalog
Artikel & mehr
Suchmaske
Suchergebnisse einschränken oder erweitern
Aktive Suchfilter
Weniger Treffer
Gefunden in
Schlagwort
- discrete mathematics 14 Treffer
- combinatorics 11 Treffer
- decoding methods 8 Treffer
- list decoding 6 Treffer
- concatenated error correction code 5 Treffer
-
45 weitere Werte:
- data_codingandinformationtheory 5 Treffer
- symbols 5 Treffer
- symbols.namesake 5 Treffer
- time complexity 5 Treffer
- berlekamp-welch algorithm 4 Treffer
- computer science::information theory 4 Treffer
- pseudorandom binary sequence 4 Treffer
- sequential decoding 4 Treffer
- algorithm 3 Treffer
- error detection and correction 3 Treffer
- estimation theory 3 Treffer
- sequence 3 Treffer
- stochastic process 3 Treffer
- upper and lower bounds 3 Treffer
- additive white gaussian noise 2 Treffer
- binary number 2 Treffer
- computer science::software engineering 2 Treffer
- computingmethodologies_symbolicandalgebraicmanipulation 2 Treffer
- finite field 2 Treffer
- linear complexity 2 Treffer
- mathematical optimization 2 Treffer
- polynomial 2 Treffer
- reed-solomon error correction 2 Treffer
- theoretical computer science 2 Treffer
- algebraic curve 1 Treffer
- applied mathematics 1 Treffer
- arithmetic 1 Treffer
- astrophysics::solar and stellar astrophysics 1 Treffer
- asymptotic formula 1 Treffer
- average-case complexity 1 Treffer
- bandwidth (signal processing) 1 Treffer
- bch code 1 Treffer
- binary code 1 Treffer
- bit error rate 1 Treffer
- block (data storage) 1 Treffer
- block code 1 Treffer
- branch and price 1 Treffer
- business 1 Treffer
- business.industry 1 Treffer
- cardinality 1 Treffer
- code (cryptography) 1 Treffer
- code division multiple access 1 Treffer
- code rate 1 Treffer
- code word 1 Treffer
- computer science 1 Treffer
Sprache
19 Treffer
-
A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q)In: IEEE Transactions on Information Theory, Jg. 46 (2000), S. 2203-2206Online unknownZugriff:
-
In: IEEE Transactions on Information Theory, Jg. 49 (2003-04-01), S. 852-865Online unknownZugriff:
-
In: IEEE Transactions on Information Theory, Jg. 48 (2002-10-01), S. 2709-2720Online unknownZugriff:
-
In: IEEE Transactions on Information Theory, Jg. 46 (2000-05-01), S. 1090-1093Online unknownZugriff:
-
In: IEEE Transactions on Information Theory, Jg. 46 (2000), S. 246-257Online unknownZugriff:
-
In: IEEE Transactions on Information Theory, Jg. 42 (1996), S. 1971-1986Online unknownZugriff:
-
In: IEEE Transactions on Information Theory, Jg. 42 (1996), S. 1987-1991Online unknownZugriff:
-
In: IEEE Transactions on Information Theory, Jg. 38 (1992), S. 1768-1778Online unknownZugriff:
-
In: IEEE Transactions on Information Theory, Jg. 51 (2005-08-01), S. 2930-2936Online unknownZugriff:
-
In: IEEE Transactions on Information Theory, Jg. 50 (2004-11-01), S. 2911-2915Online unknownZugriff:
-
In: IEEE Transactions on Information Theory, Jg. 50 (2004-10-01), S. 2468-2472Online unknownZugriff:
-
In: IEEE Transactions on Information Theory, Jg. 49 (2003-12-01), S. 3303-3307Online unknownZugriff:
-
In: IEEE Transactions on Information Theory, Jg. 49 (2003-02-01), S. 476-484Online unknownZugriff:
-
A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costsIn: IEEE Transactions on Information Theory, Jg. 44 (1998), S. 1770-1781Online unknownZugriff:
-
In: IEEE Transactions on Information Theory, Jg. 43 (1997-03-01), S. 537-548Online unknownZugriff:
-
In: IEEE Transactions on Information Theory, Jg. 41 (1995), S. 2026-2031Online unknownZugriff:
-
In: IEEE Transactions on Information Theory, Jg. 40 (1994), S. 1591-1600Online unknownZugriff:
-
In: IEEE Transactions on Information Theory, Jg. 39 (1993-05-01), S. 743-751Online unknownZugriff:
-
In: IEEE Transactions on Information Theory, Jg. 39 (1993), S. 37-45Online unknownZugriff: