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 436

  • Page / 18
Export

Selection :

  • and

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

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

MINIMIZING EXPECTED TRAVEL TIME ON GEOMETRICAL PATTERNS BY OPTIMAL PROBABILITY REARRANGEMENTSBERGMANS PP.1972; INFORM. AND CONTROL; U.S.A.; DA. 1972; VOL. 20; NO 4; PP. 331-350; BIBL. 3 REF.Serial Issue

OPTIMAL CODES, N-ARCS AND LAGUERRE GEOMETRY.HEISE W.1976; ACTA INFORMAT.; ALLEM.; DA. 1976; VOL. 6; NO 4; PP. 403-406; BIBL. 5 REF.Article

BORNE SUPERIEURE DE LA PUISSANCE DES CODES Q-NAIRESSIDORENKO VR.1975; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1975; VOL. 11; NO 3; PP. 14-20; BIBL. 2 REF.Article

CLASSES D'HEREDITE ET CODAGE DE GRAPHESALEKSEEV VE.1982; PROBLEMY KIBERNETIKI; ISSN 507989; SUN; DA. 1982; NO 39; PP. 151-164; BIBL. 11 REF.Article

OPTIMISATION DES CODES DE HAMMING TRONQUESDAVYDOV AA; KAPLAN LN; SMERKIS YU B et al.1981; PROBL. PEREDA. INF.; ISSN 0555-2923; SUN; DA. 1981; VOL. 17; NO 4; PP. 63-72; BIBL. 11 REF.Article

A NOTE ON THE CONSTRUCTION OF OPTIMAL LINEAR CODESTAMRI F.1981; J. STAT. PLANN. INFERENCE; ISSN 0378-3758; NLD; DA. 1981; VOL. 5; NO 4; PP. 405-411; BIBL. 5 REF.Article

AN EFFICIENT ALGORITHM FOR CONSTRUCTING NEARLY OPTIMAL PREFIX CODESMEHLHORN K.1980; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1980; VOL. 26; NO 5; PP. 513-517; BIBL. 8 REF.Article

SUR LES METHODES D'ALLONGEMENT DES CODESZINOV'EV VA; LITSYN SN.1982; PROBLEMY PEREDACI INFORMACII; ISSN 0555-2923; SUN; DA. 1982; VOL. 18; NO 6; PP. 29-42; BIBL. 13 REF.Article

BORNE INFERIEURE POUR LA VITESSE D'UN CODE OPTIMAL CORRECTEUR D'ERREURS ET DE DEFAUTSTSYBAKOV BS.1978; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1978; VOL. 14; NO 2; PP. 11-27; BIBL. 8 REF.Article

TREE ENCODING OF SPEECH.ANDERSON JB; BODIE JB.1975; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1975; VOL. 21; NO 4; PP. 379-387; BIBL. 17 REF.Article

PRINTERS AND READERS HANDSHAKE FOR EFFECTIVE BAR CODE SYSTEMS.WHITTAKER G; SEXTON W.1974; COMPUTER DESIGN; U.S.A.; DA. 1974; VOL. 13; NO 9; PP. 69-74Article

UNIFORM COMPLEX CODES WITH LOW AUTOCORRELATION SIDELOBES.SOMAINI U; ACKROYD MH.1974; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1974; VOL. 20; NO 5; PP. 689-691; BIBL. 8 REF.Article

LINEAR UNEQUAL ERROR PROTECTION CODESBOYARINOV IM; KATSMAN GL.1981; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1981; VOL. 27; NO 2; PP. 168-175; BIBL. 16 REF.Article

ALCUNI TEOREMI DI NON ESISTENZA DI CODICI OTTIMALI = QUELQUES THEOREMES DE NON-EXISTENCE DE CODES OPTIMAUXCONTI F; FALKNER G; HEISE W et al.1981; REND. MAT.; ISSN 0034-4427; ITA; DA. 1981; VOL. 1; NO 3; PP. 341-346; ABS. ENG; BIBL. 2 REF.Article

CODAGE D'UNE SOURCE AVEC DES PROBABILITES INCONNUES MAIS ORDONNEESRYABKO B YA.1979; PROBL. PEREDACHI INFORM.; SUN; DA. 1979; VOL. 15; NO 2; PP. 71-77; BIBL. 13 REF.Article

CODAGE OPTIMAL DES MICROINSTRUCTIONS DANS LA REPRESENTATION DES MICROOPERATIONS PAR DES CONJONCTIONS ELEMENTAIRESBELITSKIJ RI; SYROV VV.1978; KIBERNETIKA; UKR; DA. 1978; NO 5; PP. 30-33; BIBL. 1 REF.Article

CODING THEORY IN GAUSSIAN CHANNEL WITH FEEDBACK. II. EVALUATION OF THE FILTERING ERROR.IHARA S.1975; NAGOYA MATH. J.; JAP.; DA. 1975; VOL. 58; PP. 127-147; BIBL. 14 REF.Article

CYCLIC (Q+1, K)-CODES OF ODD ORDER Q AND EVEN DIMENSION K ARE NOT OPTIMALGEORGIADES J.1981; ATTI DEL SEMINARIO MATEMATICO E FISICO DELL'UNIVERSITA DI MODENA; ISSN 0041-8986; ITA; DA. 1981 PUBL. 1983; VOL. 30; NO 2; PP. 284-285; BIBL. 3 REF.Article

NOTES ON IMPULSE EQUIVALENT PULSE TRAINS.GOLAY MJE.1975; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1975; VOL. 21; NO 6; PP. 718-720; BIBL. 5 REF.Article

TWO COROLLARIES TO THE HUFFMAN CODING PROCEDURE.GECKINLI NC.1975; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1975; VOL. 21; NO 3; PP. 342-344; BIBL. 3 REF.Article

  • Page / 18