Chapter 16: Problem 3
Why is the set \(\mathbf{Z}\) not a group under subtraction?
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 16: Problem 3
Why is the set \(\mathbf{Z}\) not a group under subtraction?
All the tools & learning materials you need for study success - in one app.
Get started for free
Let $$ H=\left[\begin{array}{lllllll} 1 & 1 & 0 & 1 & 1 & 0 & 0 \\ 1 & 0 & 1 & 1 & 0 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 & 0 & 1 \end{array}\right] $$ be the parity-check matrix for a Hamming \((7,4)\) code. a) Encode the following messages: \(\begin{array}{llllll}1000 & 1100 & 1011 & 1110 & 1001 & 1111 .\end{array}\) b) Decode the following received words: \(\begin{array}{cccc}1100001 & 1110111 & 0010001 & 0011100\end{array}\) c) Construct a decoding table consisting of the syndromes and coset leaders for this code. d) Use the result in part (c) to decode the received words given in part (b).
Let \(E: \mathbf{Z}_{2}^{3} \rightarrow \mathbf{Z}_{2}^{9}\) be the encoding function for the \((9,3)\) triple repetition code. a) If \(D: \mathbf{Z}_{2}^{9} \rightarrow \mathbf{Z}_{2}^{3}\) is the corresponding decoding function, apply \(D\) to decode the received words (i) 111101100 ; (ii) 000100011 ; (iii) 010011111 . b) Find three different received words \(r\) for which \(D(r)=\) \(000 .\) c) For each \(w \in \mathbf{Z}_{2}^{3}\), what is \(\left|D^{-1}(w)\right| ?\)
Let \(G=S_{4}\). (a) For \(\alpha=\left(\begin{array}{llll}1 & 2 & 3 & 4 \\ 2 & 3 & 4 & 1\end{array}\right)\), find the subgroup \(H=\langle\alpha\rangle\). (b) Determine the left cosets of \(H\) in \(G\).
Let \(H\) and \(K\) be subgroups of a group \(G\), where \(e\) is the identity of \(G\). a) Prove that if \(|H|=10\) and \(|K|=21\), then \(H \cap K=\\{e\\}\). b) If \(|H|=m\) and \(|K|=n\), with \(\operatorname{gcd}(m, n)=1\), prove that \(H \cap K=\\{e\\}\)
A binary symmetric channel has probability \(p=0.05\) of incorrect transmission. If the code word \(c=011011101\) is transmitted, what is the probability that (a) we receive \(r=\) 011111101 ? (b) we receive \(r=111011100\) ? (c) a single error occurs? (d) a double error occurs? (e) a triple error occurs? (f) three errors occur, no two of them consecutive?
What do you think about this solution?
We value your feedback to improve our textbook solutions.