scientific article; zbMATH DE number 177889

MaRDI QIDQ4038772zbMATH OpenFDO

Authors Josep Rifà, J. Pujol

Publication date 18 May 1993

zbMATH Keywords

\(e\)-latticed distance regular graphscompletely transitive codesdistance transitive graphspropelinear binary codes

Mathematics Subject Classification ID

Cyclic codes (94B15)

Recommendations

• Families of completely transitive codes and distance transitive graphs
• Completely regular codes and completely transitive codes
• scientific article; zbMATH DE number 4110626
• Completely transitive codes in Hamming graphs
• On a class of binary linear completely transitive codes with arbitrary covering radius

Cited in

(13)

• On a class of binary linear completely transitive codes with arbitrary covering radius
• About non equivalent completely regular codes with identical intersection array
• Completely transitive codes in Hamming graphs
• Families of nested completely regular codes and distance-regular graphs
• Families of completely transitive codes and distance transitive graphs
• scientific article; zbMATH DE number 4110626 (Why is no real title available?)
• On a family of binary completely transitive codes with growing covering radius
• scientific article; zbMATH DE number 17837 (Why is no real title available?)
• Nonexistence of completely transitive codes with error-correcting capability e<3
• Completely regular codes with different parameters giving the same distance-regular coset graphs
• Theoretical Aspects of Computing – ICTAC 2005
• On completely regular codes
• Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038772)