Lin et al., 1993 - Google Patents
Structure and properties of linear recurring m-arraysLin et al., 1993
- Document ID
- 4251512276284202553
- Author
- Lin D
- Liu M
- Publication year
- Publication venue
- IEEE transactions on information theory
External Links
Snippet
Structure and properties of linear recurring m-arrays Page 1 Structure and Properties of Linear
Recurring m-Arrays Dongdai Lin and Mulan Liu Abstract-The structure of linear recurring
m-arrays is studied. It is proved that any linear recurring m-array can be obtained by “folding” an …
- 238000005070 sampling 0 abstract description 8
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/707—Spread spectrum techniques using direct sequence modulation
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/13—Linear codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/10—Code generation
- H04J13/102—Combining codes
- H04J13/105—Combining codes by extending
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/02—Details
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J13/00—Code division multiplex systems
- H04J13/0007—Code type
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
- H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/001—Modulated-carrier systems using chaotic signals
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Gyorfi et al. | Constructions of binary constant-weight cyclic codes and cyclically permutable codes | |
| Yang et al. | Quasi-orthogonal sequences for code-division multiple-access systems | |
| Sarwate | Meeting the Welch bound with equality | |
| Boztas et al. | Binary sequences with Gold-like correlation but larger linear span | |
| Xiao et al. | A spectral characterization of correlation-immune combining functions | |
| Chang et al. | Optimal (4up, 5, 1) optical orthogonal codes | |
| Udaya et al. | Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings | |
| Shaar et al. | A survey of one-coincidence sequences for frequency-hopped spread-spectrum systems | |
| Moreno et al. | A new family of frequency-hop codes | |
| US7248698B2 (en) | System for generating pseudorandom sequences | |
| Kuznetsov et al. | Formation of Pseudorandom Sequences with Special Correlation Properties | |
| Ding et al. | Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets | |
| Shedd et al. | Construction of sequences with good correlation properties (Corresp.) | |
| Cohen et al. | Linear intersecting codes | |
| Yu et al. | A new binary sequence family with low correlation and large size | |
| US7065700B2 (en) | Encoding apparatus and method in CDMA communication system | |
| Yu et al. | New binary sequences with optimal autocorrelation magnitude | |
| No et al. | New construction for families of binary sequences with optimal correlation properties | |
| Lin et al. | Structure and properties of linear recurring m-arrays | |
| Bras-Amorós | Acute semigroups, the order bound on the minimum distance, and the Feng-Rao improvements | |
| Kasami et al. | Linear block codes for error detection (Corresp.) | |
| Kumar | On the existence of square dot-matrix patterns having a specific three-valued periodic-correlation function | |
| US20010031010A1 (en) | Method and apparatus for the reflection and transmission of quasi orthogonal vectors | |
| Udaya et al. | Generalized GMW quadriphase sequences satisfying the Welch bound with equality | |
| Omrani et al. | Improved constructions and bounds for 2-D optical orthogonal codes |