Metric coset schemes revisited
From MaRDI portal
Publication:1296146
DOI10.5802/aif.1695zbMath0917.05085OpenAlexW2130346503MaRDI QIDQ1296146
Bernard Courteau, André Montpetit, Paul Camion
Publication date: 12 July 1999
Published in: Annales de l'Institut Fourier (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=AIF_1999__49_3_829_0
distance-regular graphassociation schemecovering radiusadditive codepartition designcompletely regular codeabelian schemeSchur ringprojective codecoset configurationcoset schemedistance partitionmetric coset schemeouter distribution matrixrestricted distribution matrix
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Directed distance regular graphs with the Q-polynomial property
- Parameters of association schemes that are both P- and Q-polynomial
- The girth of a directed distance-regular graph
- Completely regular codes and completely transitive codes
- On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\)
- Hyperplane codes
- Non-symmetric, metric, cometric association schemes are self-dual
- On \(r\)-partition designs in Hamming spaces
- Completely regular codes
- Coherent configurations. I: Ordinary representation theory
- Bilinear forms over a finite field, with applications to coding theory
- Quotients of association schemes
- Dual distances of completely regular codes
- Linear codes with given automorphism groups
- A Lloyd theorem in weakly metric association schemes
- Weight Distribution of Translates of Linear Codes and Generalized Pless Indentities
- Weight distribution of cosets of 2-error-correcting binary BCH codes of length 15, 63 and 255
- Four fundamental parameters of a code and their combinatorial significance
This page was built for publication: Metric coset schemes revisited
