default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 56
Volume 56, Number 1, September 1985
- Jin Akiyama, Kiyoshi Ando, David Avis:
Eccentric graphs. 1-6 - Claude Benzaken, Peter L. Hammer:
Boolean techniques for matroidal decomposition of independence systems and applications to graphs. 7-34 - Gérard D. Cohen, Abraham Lempel:
Linear intersecting codes. 35-43 - William L. Kocay, Douglas R. Stinson, Scott A. Vanstone:
On strong starters in cyclic groups. 45-60 - Doron Zeilberger:
A combinatorial approach to matrix algebra. 61-72 - G. W. Peck:
On 'k-sets' in the plane. 73-74 - P. Szüsz:
On a theorem of Fraenkel, Levitt and Shimshoni. 75-77 - Morimasa Tsuchiya:
On determination of graph G whose bond lattice L(G) is modular. 79-81 - Alexander R. Bednarek:
Whitney's theorem for infinite graphs. 83-85 - Bojan Mohar, Tomaz Pisanski, Martin Skoviera, Arthur T. White:
The cartesian product of three triangles can be embedded into a surface of genus 7. 87-89
Volume 56, Numbers 2-3, October 1985
- Thomas Beth:
Generalizing the discrete fourier transform. 95-100 - Jacques Calmet:
Algebraic algorithms in GF(q). 101-109 - Ricardo M. Campello de Souza, Patrick Guy Farrell:
Finite field transforms and symmetry groups. 111-116 - Pascale Charpin:
A description of some extended cyclic codes with application to Reed-Solomon codes. 117-124 - Gérard D. Cohen, Peter Frankl:
Good coverings of Hamming spaces with spheres. 125-131 - Bernard Courteau, Jean Goulet:
An extension of the codes introduced by Séguin, allard and Bhargava. 133-139 - J. Dénes:
On some connections between permutations and coding. 141-146 - Gui Liang Feng:
Generalized threshold decoding of cyclic codes. 147-154 - M. C. Gennero, Odile Papini:
Utilization of error correcting codes for data transmission simulations. 155-168 - Tor Helleseth, Harold F. Mattson:
On the cosets of the simplex code. 169-189 - Ll. Huguet:
Coding scheme for a wire-tap channel using regular codes. 191-201 - Meega Kumari:
Complexity analysis of binary nonlinear feedforward sequences through minimum polynomials of compound matrices. 203-215 - D. Lugiez:
Fast Hensel's lifting implementation using partial fraction decomposition. 217-225 - Bernard Montaron:
On incidence matrices of finite projective planes. 227-237 - Philippe Piret:
Word correction by means of convolutional codes. 239-243 - Ioannis Pitas, Michael G. Strintzis:
Special algorithms for convolutions over Galois fields. 245-253 - Alain Poli:
Important algebraic calculations for n-variables polynomial codes. 255-263 - Alain Poli, J. A. Thiong-Ly:
Automorphisms of principal nilpotent self-dual codes in certain modular algebras. 265-273 - C. Rigoni:
Construction of n variable codes. 275-280 - Kenneth K. Tzeng, Gui Liang Feng:
Further results about the cyclicity of generalized Goppa codes. 281-290 - Michel Ventou, C. Rigoni:
Self-dual doubly circulant codes. 291-298 - Jacques Wolfmann:
A class of doubly even self dual binary codes. 299-303
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.
last updated on 2025-12-01 23:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
