THE ASYMPTOTIC MAXIMAL MERIT FACTOR OF INDEFINITELY LONG BINARY SEQUENCESGOLAY MJE.1981; PROC. IEEE; ISSN 0018-9219; USA; DA. 1981; VOL. 69; NO 9; PP. 1161; BIBL. 2 REF.Article

A SIMPLE TECHNIQUE FOR THE DETERMINATION OF DELAYED MAXIMAL LENGTH LINEAR BINARY SEQUENCES.MILLER AJ; BROWN AW; MARS P et al.1977; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1977; VOL. 26; NO 8; PP. 808-811; BIBL. 6 REF.Article

ENDLICHE AUTOMATEN UND ZUFALLSFOLGEN = AUTOMATES FINIS ET SUITES ALEATOIRESSCHNORR CP; STIMM H.1972; ACTA INFORMAT.; ALLEM.; DA. 1972; VOL. 1; NO 4; PP. 345-359; ABS. ANGL.; BIBL. 13 REF.Serial Issue

GENERATION OF THE APPROXIMATIONS TO BINARY WHITE NOISE.MOHARIR PS.1975; J. INSTIT. ELECTRON. TELECOMMUNIC. ENGRS; INDIA; DA. 1975; VOL. 21; NO 1; PP. 5-7; BIBL. 2 REF.Article

A FAST ALGORITHM FOR DETERMINING THE COMPLEXITY OF A BINARY SEQUENCE WITH PERIOD 2^NGAMES RA; HUI CHAN A.1983; IEEE TRANSACTIONS ON INFORMATION THEORY; ISSN 0018-9448; USA; DA. 1983; VOL. 29; NO 1; PP. 144-146; BIBL. 4 REF.Article

WELTI-CODESUND CODEKOLLEKTIVE = CODES DE WELTI ET ARRANGEMENTS DE SEQUENCES CODEESLUKE HD.1982; AEUE, ARCH. ELEKTRON. UEBERTRAGUNGSTECH.; ISSN 0001-1096; DEU; DA. 1982; VOL. 36; NO 6; PP. 223-228; ABS. ENG; BIBL. 11 REF.Article

PROPERTIES OF A SIMPLE NOISE-SEQUENCE GENERATORFREEMAN W; HEBDEN SM.1980; ELECTRON. LETTERS; GBR; DA. 1980; VOL. 16; NO 2; PP. 55-57; BIBL. 5 REF.Article

INVESTIGATION INTO A CLASS OF NONLINEAR CYCLIC BINARY SEQUENCES: GENERATION, PROPERTIES AND APPLICATIONS.TERRELL TJ; POWNER ET.1976; PROC. INSTIT. ELECTR. ENGRS; G.B.; DA. 1976; VOL. 123; NO 12; PP. 1380-1386; BIBL. 23 REF.Article

DILUTE UNIFORMLY REDUNDANT SEQUENCES FOR USE IN CODED-APERTURE IMAGINGWILD WJ.1983; OPTICS LETTERS; ISSN 0146-9592; USA; DA. 1983; VOL. 8; NO 5; PP. 247-249; BIBL. 15 REF.Article

A SURVEY OF FULL LENGTH NONLINEAR SHIFT REGISTER CYCLE ALGORITHMSFREDRICKSEN H.1982; SIAM REV.; ISSN 0036-1445; USA; DA. 1982; VOL. 24; NO 2; PP. 195-221; BIBL. 2 P.Article

AN IMPROVED GENERATION TECHNIQUE FOR RANDOM NUMBER SEQUENCESDEANS ND; MANN DP.1982; MATH. COMPUT. SIMUL.; ISSN 0378-4754; NLD; DA. 1982; VOL. 24; NO 4; PP. 314-325; BIBL. 14 REF.Article

CODE DIVISION MULTIPLEXING BY FREQUENCY SHIFTED BIPHASE MODULATED M-SEQUENCESGOLDBERG BG.1981; IEEE TRANS. AEROSP. ELECTRON. SYST.; ISSN 0018-9251; USA; DA. 1981; VOL. 17; NO 2; PP. 303-304; BIBL. 2 REF.Article

DECOMPOSITION OF BINARY SEQUENCES OF FINITE PERIODS AND A CLASS OF ERROR CORRECTING CODESHWANG JC.1980; DIGIT. PROCESS.; CHE; DA. 1980; VOL. 6; NO 1; PP. 1-20; ABS. FRE/GER; BIBL. 18 REF.Article

COMPLEXITY DEPS IN RANDOM INFINITE BINARY SEQUENCESKATSEFF HP.1978; INFORM. AND CONTROL; USA; DA. 1978; VOL. 38; NO 3; PP. 258-263; BIBL. 4 REF.Article

HIGH-SPEED GENERATION OF LONG M-SEQUENCES.TOMLINSON GH; GALVIN P.1978; ELECTRON. LETTERS; G.B.; DA. 1978; VOL. 14; NO 7; PP. 212-213; BIBL. 7 REF.Article

ON DIFFERENT TIME-DOMAIN SOLUTIONS OF THE PROBLEM OF GENERATING SHIFTED LINEAR BINARY SEQUENCES.LATAWIEC KJ.1977; PROBL. CONTROL INFORM. THEORY; HUNGARY; DA. 1977; VOL. 6; NO 4; PP. 223-230; ABS. RUSSE; BIBL. 5 REF.Article

ERMITTLUNG DER GEWICHTSFUNKTION AUS DER KREUZKORRELATIONSFUNKTION BEI IDENTIFIKATION MIT BINAERFOLGEN MAXIMALER LAENGE = DETERMINATION DE LA FONCTION DE PONDERATION A PARTIR DE LA FONCTION DE CORRELATION CROISEE PENDANT L'IDENTIFICATION DANS LE CAS DE SUITES BINAIRES DE LONGUEUR MAXIMUMFRIEDRICH R; HAASE J.1977; WISSENSCH. Z. WILHELM-PIECK-UNIV. ROSTOCK, MATH.-NATURWISSENSCH. REIHE; DDR; DA. 1977; VOL. 26; NO 10; PP. 1047-1050; ABS. RUS/ENG/FRE; BIBL. 2 REF.Article

A KING OF PULSE TRANSMISSION CODE WITH ZERO SEQUENCE SUBSTITUTION.FUKINUKI H; KAWAKAMI M.1976; TRANS. INST. ELECTRON. COMMUNIC. ENGRS JAP., E; JAP.; DA. 1976; VOL. 59; NO 8; PP. 11-12; RESUMEArticle

PROPERTIES OF THE SUBSEQUENCES OF A CLASS OF LINEAR PRODUCT SEQUENCES.TOMLINSON GH; GALVIN P.1975; PROC. INSTIT. ELECTR. ENGRS; G.B.; DA. 1975; VOL. 122; NO 10; PP. 1095-1096; BIBL. 6 REF.Article

ON THE CLASSIFICATION OF BALANCED BINARY SEQUENCES OF PERIOD 2⁴-1GOLOMB SW.1980; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1980; VOL. 26; NO 6; PP. 730-732; BIBL. 2 REF.Article

RECURSIVE CODE GENERATION BASED ON M-SEQUENCEPOTTER JM.1980; ELECTRON. LETT.; ISSN 0013-5194; GBR; DA. 1980; VOL. 16; NO 22; PP. 858-859; BIBL. 1 REF.Article

SOFT DECISION DECODING WITH UNKNOWN SOURCE DISTRIBUTIONWOLFENSON M; DA ROCHA VC.1980; ELECTRON. LETT.; GBR; DA. 1980; VOL. 16; NO 25-26; PP. 949-950; BIBL. 8 REF.Article

SEQUENCES PERIODIQUES BINAIRES AVEC DE FAIBLES PERTES SUR L'AFFAIBLISSEMENT DES LOBES LATERAUXIPATOV VP.1980; IZVEST. VYSSH. UCHEBN. ZAVED., RADIOELEKTRON.; UKR; DA. 1980; VOL. 23; NO 1; PP. 20-25; BIBL. 6 REF.Article

SYNDROME DECODING OF BINARY RATE K/N CONVOLUTIONAL CODES = DECODAGE EN SYNDROME DES CODES CONVOLUTIONNELS A TAUX BINAIRE K/NSCHALKWIJK JPM; VINCK AJ; POST KA et al.1978; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1978; VOL. 24; NO 5; PP. 553-562; BIBL. 8 REF.Article

AN ANALYSIS OF THE STRUCTURE AND COMPLEXITY OF NONLINEAR BINARY SEQUENCE GENERATORS.KEY EL.1976; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1976; VOL. 22; NO 6; PP. 732-736; BIBL. 8 REF.Article