default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 41 matches
- 2001
- Víctor Álvarez, José Andrés Armario, María Dolores Frau, Pedro Real:
An Algorithm for Computing Cocyclic Matrices Developed over Some Semidirect Products. AAECC 2001: 287-296 - Vladimir B. Balakirsky:
On Algebraic Soft Decision Decoding of Cyclic Binary Codes. AAECC 2001: 315-322 - A. Baliga, Joselíto J. Chua:
Self-dual Codes Using Image Restoration Techniques. AAECC 2001: 46-56 - Thierry P. Berger, Louis de Maximy:
Cyclic Projective Reed-Muller Codes. AAECC 2001: 77-81 - Koichi Betsumiya, Masaaki Harada, Akihiro Munemasa:
Type II Codes over F2r. AAECC 2001: 102-111 - François Boulier, Sylvain Neut:
Cartan's Characters and Stairs of Characteristic Sets. AAECC 2001: 363-372 - Eimear Byrne:
Lifting Decoding Schemes over a Galois Ring. AAECC 2001: 323-332 - E. Cadic, Jean-Claude Carlach, G. Olocco, Ayoub Otmani, Jean-Pierre Tillich:
Low Complexity Tail-Biting Trellises of Self-dual codes of Length 24, 32 and 40 over GF(2) and Z4 of Large Minimum Distance. AAECC 2001: 57-66 - Chris Charnes, Martin Rötteler, Thomas Beth:
On Homogeneous Bent Functions. AAECC 2001: 249-259 - Bikash Kumar Dey, B. Sundar Rajan:
Fq-Linear Cyclic Codes over Fq: DFT Characterization. AAECC 2001: 67-76 - Alberto Peinado Domínguez, Fausto Montoya Vitini, Jaime Muñoz Masqué, Antonio J. Yuste:
Maximal Periods of x + c in Fq. AAECC 2001: 219-228 - Sylvia B. Encheva, Gérard D. Cohen:
Partially Identifying Codes for Copyright Protection. AAECC 2001: 260-267 - Pierrick Gaudry, Éric Schost:
On the Invariants of the Quotients of the Jacobian of a Curve of Genus 2. AAECC 2001: 373-386 - Olav Geil, Tom Høholdt:
On Hyperbolic Codes. AAECC 2001: 159-171 - Mark Giesbrecht, Michael J. Jacobson Jr., Arne Storjohann:
Algorithms for Large Integer Matrix Problems. AAECC 2001: 297-307 - Andrew M. Guidi, Alex J. Grant, Steven S. Pietrobon:
Algebraic Constructions for PSK Space-Time Coded Modulation. AAECC 2001: 387-396 - T. Aaron Gulliver, Masaaki Harada:
Optimal Double Circulant Z4-Codes. AAECC 2001: 122-128 - Manish K. Gupta, David G. Glynn, T. Aaron Gulliver:
On Senary Simplex Codes. AAECC 2001: 112-121 - Venkatesan Guruswami:
Constructions of Codes from Number Fields. AAECC 2001: 129-140 - Jaime Gutierrez, Domingo Gómez-Pérez:
Iterations of Multivariate Polynomials and Discrepancy of Pseudorandom Numbers. AAECC 2001: 192-199 - Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn:
On the Identification of Vertices and Edges Using Cycles. AAECC 2001: 308-314 - Hiroshi Horimoto, Keisuke Shiromoto:
On Generalized Hamming Weights for Codes over Finite Chain Rings. AAECC 2001: 141-150 - Tadao Kasami, Hitoshi Tokushige, Yuichi Kaji:
Sufficient Conditions on Most Likely Local Sub-codewords in Recursive Maximum Likelihood Decoding Algorithms. AAECC 2001: 333-342 - Andrei V. Kelarev, Olga Sokratova:
Information Rates and Weights of Codes in Structural Matrix Rings. AAECC 2001: 151-158 - Margreta Kuijper, Marten van Dijk, Henk D. L. Hollmann, Job Oostveen:
A Unifying System-Theoretic Framework for Errors-and-Erasures Reed-Solomon Decoding. AAECC 2001: 343-352 - Tero Laihonen, Sanna M. Ranto:
Codes Identifying Sets of Vertices. AAECC 2001: 82-91 - James L. Massey:
The Ubiquity of Reed-Muller Codes. AAECC 2001: 1-12 - Matthew Geoffrey Parker:
Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation. AAECC 2001: 200-209 - Patrice Parraud:
On the Non-existence of (Almost-)Perfect Quaternary Sequences. AAECC 2001: 210-218 - Vera Pless:
Self-dual Codes-Theme and Variations. AAECC 2001: 13-21
skipping 11 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-12-29 17:16 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint