Thread:

1. Self Dual matrix

Hi, I was wondering if anyone could help me solve this question from a past paper:

Let C be the code with parity check matrix:
$\begin{pmatrix}0 0 0 1 1 1 1 0 \\ 0 1 1 0 0 1 1 0 \\ 1 0 1 0 1 0 1 0 \\ 1 1 1 1 1 1 1 1 \\ \end{pmatrix}$

Prove that C is self dual. (You can assume that the dual of an (n,k)-code is an (n,n-k) code and that)
What is d for this code?

I have worked out that the matrix times by its transpose is equal to 0 to show it is orthogonal but I am unsure where to go from here
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 1, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9681347608566284, "perplexity_flag": "head"}