Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Code optimal")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 680

  • Page / 28
Export

Selection :

  • and

Un renforcement de la formule d'énumération des poids des codes optimaux = Reinforcement of enumeration formula of optimal codes weightsBONNEAU, P; SCHÜTZENBERGER, M.Comptes rendus des séances de l'Académie des sciences. Série 1, Mathématique. 1983, Vol 296, Num 20, pp 863-864, issn 0249-6291Article

OPTIMISATION DES EXPRESSIONS ARITHMETIQUES. EXTENSIONS DES ALGORITHMES DE R. SETHI ET J. D. ULLMANLOUIT G.1972; IN: TECH. INF. CONGR. AFCET. GRENOBLE, 1972; PARIS; AFCET; DA. 1972; VOL. 1; PP. 429-444; BIBL. 5 REF.Conference Paper

The Sizes of Optimal q-Ary Codes of Weight Three and Distance Four : A Complete SolutionYEOW MENG CHEE; SON HOANG DAU; LING, Alan C. H et al.IEEE transactions on information theory. 2008, Vol 54, Num 3, pp 1291-1295, issn 0018-9448, 5 p.Article

The uniqueness of the best codeLITSYN, S; VARDY, A.IEEE transactions on information theory. 1994, Vol 40, Num 5, pp 1693-1698, issn 0018-9448Article

Le code génétique, code instantané absolument optimal = The genetic code is an instantaneous code absolutely optimalCULLMANN, G; LABOUYGUES, J. M.Comptes rendus de l'Académie des sciences. Série 3, Sciences de la vie. 1985, Vol 301, Num 5, pp 157-160, issn 0764-4469Article

Is every compact code Huffman ?WOOD, J. H.Discrete mathematics. 1992, Vol 110, Num 1-3, pp 297-299, issn 0012-365XArticle

Optimal quantization in neural codingMCDONNELL, Mark; ABBOTT, Derek.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 494Conference Paper

Optimal optical orthogonal codes with λ > 1OMRANI, Reza; MORENO, Oscar; VIJAY KUMAR, P et al.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 366Conference Paper

Four nonexistence results for ternary linear codesVAN EUPEN, M.IEEE transactions on information theory. 1995, Vol 41, Num 3, pp 800-805, issn 0018-9448Article

Optimum codes of dimension 3 and 4 over GF(4)BHANDARI, M. C; GARG, M. S.IEEE transactions on information theory. 1992, Vol 38, Num 5, pp 1564-1567, issn 0018-9448Article

Optimal Constant Weight CodesGASHKOV, Igor.Lecture notes in computer science. 2006, pp 912-915, issn 0302-9743, isbn 3-540-34379-2, 4 p.Conference Paper

Combinatorial constructions of optimal constant-composition codesCUNSHENG DING; JIANXING YIN.IEEE transactions on information theory. 2005, Vol 51, Num 10, pp 3671-3674, issn 0018-9448, 4 p.Article

A new class of optimal optical orthogonal codes with weight fiveSHIKUI MA; YANXUN CHANG.IEEE transactions on information theory. 2004, Vol 50, Num 8, pp 1848-1850, issn 0018-9448, 3 p.Article

Region-based partial dead code elimination on predicated codeQIONG CAI; LIN GAO; JINGLING XUE et al.Lecture notes in computer science. 2004, pp 150-166, issn 0302-9743, isbn 3-540-21297-3, 17 p.Conference Paper

Optimal Conflict-Avoiding Codes of Even Length and Weight 3FU, Hung-Lin; LIN, Yi-Hean; MISHIMA, Miwako et al.IEEE transactions on information theory. 2010, Vol 56, Num 11, pp 5747-5756, issn 0018-9448, 10 p.Article

Good Linear Codes from Polynomial EvaluationsYANG DING; LINGFEI JIN; CHAOPING XING et al.IEEE transactions on communications. 2012, Vol 60, Num 2, pp 357-363, issn 0090-6778, 7 p.Article

Identification of T-codes with minimal average synchronisation delayFONG, A. C. M; HIGGIE, G. R.IEE proceedings. Computers and digital techniques. 2000, Vol 147, Num 4, pp 237-240, issn 1350-2387Article

An achievable bound for optimal noiseless coding of a random variableVERRIEST, E. I.IEEE transactions on information theory. 1986, Vol 32, Num 4, pp 592-594, issn 0018-9448Article

Optimal feedback schemes over unknown channelsTCHAMKERTEN, Asian; TELATAR, Emre I.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 379Conference Paper

Optimal double circulant Z4-CodesGULLIVER, T. Aaron; HARADA, Masaaki.Lecture notes in computer science. 2001, pp 122-128, issn 0302-9743, isbn 3-540-42911-5Conference Paper

COMPILING OPTIMIZED CODE FROM DECISION TABLESMYERS HJ.1972; I.B.M. J. RES. DEVELOP.; U.S.A.; DA. 1972; VOL. 16; NO 5; PP. 489-503; BIBL. 15 REF.Serial Issue

ES GIBT KEINEN OPTIMALEN (N+2,3). CODE EINER UNGERADEN ORANUNGN = IL N'EXISTE PAS DE CODE OPTIMAL (N+2,3) D'ORDRE N IMPAIRHEISE W.1978; MATH. Z.; DEU; DA. 1978; VOL. 164; NO 1; PP. 67-68; BIBL. 3 REF.Article

RESTRICTED MI-SPACES, RESTRICTED LI-SPACES, OPTIMAL CODES AND N-ARCSWILLEMS MLH.1983; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1983; NO 78; PP. 789-801; BIBL. 20 REF.Conference Paper

UEBER DIE MAXIMALE BLOCKLAENGE OPTIMALER CODES = SUR LA LONGUEUR BLOC MAXIMALE DE CODES OPTIMAUXHEISE W.1979; SER. INTERNATION. ANAL. NUMER.; CHE; DA. 1979; VOL. 46; PP. 128-134; BIBL. 6 REF.Conference Paper

OPTIMAL RECTANGULAR CODE FOR HIGH DENSITY MAGNETIC TAPES.PATEL AM; HONG SJ.1974; I.B.M. J. RES. DEVELOP.; U.S.A.; DA. 1974; VOL. 18; NO 6; PP. 579-588; BIBL. 11 REF.Article

  • Page / 28