Tootfinder

"Stark-Watzinger muss zurücktreten
Das Bildungsministerium wollte kritischen Wissenschaftlern die Fördermittel streichen: Das ist ein Fall von Machtmissbrauch. Er liegt im autoritären Trend."
Guter Text zu #StarkWatzinger und ihren versuchten Eingriffen in die #Wissenschaftsfreiheit

Wissenschaftsfreiheit in Deutschland: Stark-Watzinger muss zurücktreten
Das Bildungsministerium wollte kritischen Wissenschaftlern die Fördermittel streichen: Das ist ein Fall von Machtmissbrauch. Er liegt im autoritären Trend.

Eigentlich müsste es einen Aufstand aus der gesamten Wissenschaft geben, Stark-Watzinger muss eigentlich zurücktreten.
Ich fürchte allerdings, dass jetzt noch mehr von denen den Mund halten werden.
Der Chiling Effect wird durch den Panorama-Text verstärkt.
Kipppunkt schon erreicht.
#BMBF

An ODMA-Based Unsourced Random Access Scheme with a Multiple Antenna Receiver
Mert Ozates, Mohammad Kazemi, Tolga M. Duman
https://arxiv.org/abs/2406.06284

An ODMA-Based Unsourced Random Access Scheme with a Multiple Antenna Receiver
We investigate the unsourced random access scheme assuming that the base station is equipped with multiple antennas, and propose a high-performing solution utilizing on-off-division multiple access. We assume that each user spreads its pilot sequence and polar codeword to the pilot and data parts of the transmission frame, respectively, based on a transmission pattern. The iterative receiver operation consists of pilot and pattern detection followed by channel vector and symbol estimation, pola…

An ODMA-Based Unsourced Random Access Scheme with a Multiple Antenna Receiver
Mert Ozates, Mohammad Kazemi, Tolga M. Duman
https://arxiv.org/abs/2406.06284

An ODMA-Based Unsourced Random Access Scheme with a Multiple Antenna Receiver
We investigate the unsourced random access scheme assuming that the base station is equipped with multiple antennas, and propose a high-performing solution utilizing on-off-division multiple access. We assume that each user spreads its pilot sequence and polar codeword to the pilot and data parts of the transmission frame, respectively, based on a transmission pattern. The iterative receiver operation consists of pilot and pattern detection followed by channel vector and symbol estimation, pola…

Improved bounds on the size of permutation codes under Kendall $\tau$-metric
Farzad Parvaresh, Reza Sobhani, Alireza Abdollahi, Javad Bagherian, Fatemeh Jafari, Maryam Khatami
https://arxiv.org/abs/2406.06029

Improved bounds on the size of permutation codes under Kendall $τ$-metric
In order to overcome the challenges caused by flash memories and also to protect against errors related to reading information stored in DNA molecules in the shotgun sequencing method, the rank modulation is proposed. In the rank modulation framework, codewords are permutations. In this paper, we study the largest size $P(n, d)$ of permutation codes of length $n$, i.e., subsets of the set $S_n$ of all permutations on $\{1,\ldots, n\}$ with the minimum distance at least $d\in\{1,\ldots ,\binom{n…

Have a refreshing #Caturday 👅🧊

Improved bounds on the size of permutation codes under Kendall $\tau$-metric
Farzad Parvaresh, Reza Sobhani, Alireza Abdollahi, Javad Bagherian, Fatemeh Jafari, Maryam Khatami
https://arxiv.org/abs/2406.06029

Improved bounds on the size of permutation codes under Kendall $τ$-metric
In order to overcome the challenges caused by flash memories and also to protect against errors related to reading information stored in DNA molecules in the shotgun sequencing method, the rank modulation is proposed. In the rank modulation framework, codewords are permutations. In this paper, we study the largest size $P(n, d)$ of permutation codes of length $n$, i.e., subsets of the set $S_n$ of all permutations on $\{1,\ldots, n\}$ with the minimum distance at least $d\in\{1,\ldots ,\binom{n…

#Caturday
#CatsOfMastodon

This https://arxiv.org/abs/2312.11302 has been replaced.
link: https://scholar.google.com/scholar?q=a

AFDM-SCMA: A Promising Waveform for Massive Connectivity over High Mobility Channels
This paper studies the affine frequency division multiplexing (AFDM)-empowered sparse code multiple access (SCMA) system, referred to as AFDM-SCMA, for supporting massive connectivity in high-mobility environments. First, by placing the sparse codewords on the AFDM chirp subcarriers, the input-output (I/O) relation of AFDM-SCMA systems is presented. Next, we delve into the generalized receiver design, chirp rate selection, and error rate performance of the proposed AFDM-SCMA. The proposed AFDM-…

Linear Codes from Projective Linear Anticodes Revisited
Hao Chen, Conghui Xie
https://arxiv.org/abs/2406.07112 https://arxiv.org/pdf/…

Linear Codes from Projective Linear Anticodes Revisited
An anticode ${\bf C} \subset {\bf F}_q^n$ with the diameter $δ$ is a code in ${\bf F}_q^n$ such that the distance between any two distinct codewords in ${\bf C}$ is at most $δ$. The famous Erdös-Kleitman bound for a binary anticode ${\bf C}$ of the length $n$ and the diameter $δ$ asserts that $$|{\bf C}| \leq Σ_{i=0}^{\fracδ{2}} \displaystyle{n \choose i}.$$ In this paper, we give an antiGriesmer bound for $q$-ary projective linear anticodes, which is stronger than the above Erd…