MyFinder is a unique search engine with a simple privacy concept in mind. We log your searches but none of the data, it's that simple.
Error correction codeError detection and correctionErasure codeNoisy-channel coding theoremHuffman codingConvolutional codeChannel capacityLow-density parity-check codeEntropy codingInformation theoryCanonical huffman codeData-rate unitsHadamard codeData compression ratioShannon codingHammingSoft-decision decoderBurst error-correcting codeData compressionShannon's source coding theoremHamming codeCross entropyFano's inequalityBit error rateConditional entropyInformation entropyCoding theoryEntropy rateSystematic codeRedundancyInformation contentCodeConcatenated error correction codeSuperdense codingFountain codeOutage probabilityBinary golay codeBch codeQuantities of informationSub-band codingConditional mutual informationAlgorithmic information theoryQuantum threshold theoremMutual informationGoodputHash functionPolynomial codeBinary entropy functionSelf-synchronizing codeDigital dataLinear codeTheory of computationBlock cipherChecksumEfficiencyEntropyData communicationHamming distanceEmpirical orthogonal functionsAsymptotic equipartition propertyHmacRound-trip delayFrequency analysisPointwise mutual informationCoefficient of variationTransmission functionCoherence bandwidthNegentropyKeystreamNoise spectral densityParity-check matrixPseudo-polynomial timeRun-length encodingTotal correlationCorrelation ratioBarker codeSignal-to-noise ratioSecurity levelBayes error rateAlgorithmic efficiencyLinear predictive codingProbabilistically checkable proofCharacterComplexity functionPseudorandom generatorCompandingNyquist isi criterionKey derivation functionCoefficient of determinationBlum's speedup theoremBinary-coded decimalHamming boundForward secrecyUnicity distanceProbability-generating functionKey sizeHadamard transformLossy compressionInverse fourier transformDiscrete fourier transform