• 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.

found 20 matches

• 1992
• 
  Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zémor:
  Algebraic Coding, First French-Soviet Workshop, Paris, France, July 22-24, 1991, Proceedings. Lecture Notes in Computer Science 573, Springer 1992, ISBN 3-540-55130-1 [contents]
• 1991
• 
  Benjamin Arazi:
  Position Recovery on a Circle Based on Coding Theory. Algebraic Coding 1991: 87-101
• 
  Alexei E. Ashikhmin, Simon Litsyn:
  A Fast Search for the Maximum Element of the Fourier Spectrum. Algebraic Coding 1991: 134-141
• 
  Vladimir B. Balakirsky:
  Coding Theorem for Discrete Memoryless Channels with Given Decision Rule. Algebraic Coding 1991: 142-150
• 
  Alexander Barg:
  Exponential Sums and Constrained Error-Correcting Codes. Algebraic Coding 1991: 16-22
• 
  Volodia Blinovsky:
  The Lower Bound for Cardinality of Codes Correcting Errors and Defects. Algebraic Coding 1991: 102-112
• 
  Irina E. Bocharova:
  Decoding for Multiple-Access Channels. Algebraic Coding 1991: 151-158
• 
  Gérard D. Cohen, Simon Litsyn, H. F. Mattson Jr.:
  On Perfect Weighted Coverings with Small Radius. Algebraic Coding 1991: 32-41
• 
  Alexander A. Davydov:
  Constructions of Codes with Covering Radius 2. Algebraic Coding 1991: 23-31
• 
  Ilya Dumer:
  On Nonbinary Codes with Fixed Distance. Algebraic Coding 1991: 67-74
• 
  Ernst M. Gabidulin:
  A Fast Matrix Decoding Algorithm for Rank-Error-Correcting Codes. Algebraic Coding 1991: 126-133
• 
  Danièle Gardy, Patrick Solé:
  Saddle Point Techniques in Asymptotic Coding Theory. Algebraic Coding 1991: 75-81
• 
  G. L. Katsman:
  Bounds on Covering Radius of Dual Product Codes. Algebraic Coding 1991: 52-57
• 
  Sergei I. Kovalev:
  Nonbinary Low Rate Convolutional Codes with Almost Optimum Weight Spectrum. Algebraic Coding 1991: 82-86
• 
  Boris D. Kudryashov:
  Soft Decoding for Block Codes Obtained from Convolutional Codes. Algebraic Coding 1991: 113-119
• 
  Vera Pless:
  Remarks on Greedy Codes. Algebraic Coding 1991: 58-66
• 
  Igor E. Shparlinski:
  On Gaussian Sums for Finite Fields and Elliptic Curves. Algebraic Coding 1991: 5-15
• 
  Jakov Snyders:
  Partial Ordering of Error Patterns for Maximum Likelihood Soft Decoding. Algebraic Coding 1991: 120-125
• 
  Aimo Tietäväinen:
  On the Correlation fo Sequences. Algebraic Coding 1991: 1-4
• 
  Gilles Zémor:
  An Extremal Problem Related to the Covering Radius of Binary Codes. Algebraic Coding 1991: 42-51