Mirror/aicodix___code
1
0
Fork 0
mirror of https://github.com/aicodix/code.git synced 2026-04-27 14:30:36 +00:00
Code Issues Projects Releases Packages Wiki Activity

renamed and updated Bhattacharyya code construction

Browse source
This commit is contained in:
Ahmet Inan 2025-12-28 10:15:55 +01:00
commit 46153c59b2
5 changed files with 12 additions and 12 deletions
Download patch file Download diff file Expand all files Collapse all files

8
polar_sequence.hh
View file

@ -6,12 +6,12 @@ Copyright 2023 Ahmet Inan <inan@aicodix.de>
#pragma once
#include <algorithm>
#include "sort.hh"
namespace CODE {
template <int MAX_M>
class PolarSeqConst0
class BhattacharyyaSequence
{
void compute(double pe, int i, int h)
{
@ -23,7 +23,7 @@ class PolarSeqConst0
}
}
double prob[1<<MAX_M];
int index[1<<MAX_M];
MergeSort<int, 1<<MAX_M> sort;
public:
void operator()(int *sequence, int level, double erasure_probability = std::exp(-1.))
{
@ -32,7 +32,7 @@ public:
compute(erasure_probability, 0, length / 2);
for (int i = 0; i < length; ++i)
sequence[i] = i;
std::sort(sequence, sequence+length, [this](int a, int b){ return prob[a] > prob[b]; });
sort(sequence, length, [this](int a, int b){ return prob[a] > prob[b]; });
}
};