Pages that link to "Item:Q2436559"

The following pages link to New families of completely regular codes and their corresponding distance regular coset graphs (Q2436559):

Displaying 21 items.

• Entry-faithful 2-neighbour transitive codes (Q281316) (← links)
• On a family of binary completely transitive codes with growing covering radius (Q394307) (← links)
• On the binary codes with parameters of triply-shortened 1-perfect codes (Q438873) (← links)
• Completely regular codes with different parameters giving the same distance-regular coset graphs (Q526258) (← links)
• Conway groupoids and completely transitive codes (Q722342) (← links)
• On new completely regular \(q\)-ary codes (Q926628) (← links)
• On non-antipodal binary completely regular codes (Q932675) (← links)
• On a class of binary linear completely transitive codes with arbitrary covering radius (Q1044974) (← links)
• Yet another distance regular graph related to a Golay code (Q1344396) (← links)
• About non equivalent completely regular codes with identical intersection array (Q1743305) (← links)
• Completely regular codes by concatenating Hamming codes (Q1783729) (← links)
• On the classification of binary completely transitive codes with almost-simple top-group (Q2080231) (← links)
• 2-neighbour-transitive codes with small blocks of imprimitivity (Q2294111) (← links)
• A new distance-regular graph of diameter 3 on 1024 vertices (Q2324787) (← links)
• Families of nested completely regular codes and distance-regular graphs (Q2346713) (← links)
• Uniqueness of certain completely regular Hadamard codes (Q2349177) (← links)
• Families of completely transitive codes and distance transitive graphs (Q2440945) (← links)
• Arithmetic completely regular codes (Q2808536) (← links)
• (Q5882608) (← links)
• On completely regular codes (Q5970864) (← links)
• On completely regular codes with minimum eigenvalue in geometric graphs (Q6041848) (← links)